Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed

dc.contributor.author Jorge Valente en
dc.contributor.author Schaller,J en
dc.contributor.other 5815 en
dc.date.accessioned 2021-04-13T14:37:20Z
dc.date.available 2021-04-13T14:37:20Z
dc.date.issued 2019 en
dc.description.abstract The two-machine permutation flow shop scheduling problem with the objective of minimizing total earliness and tardiness is addressed. Unforced idle time can be used to complete jobs closer to their due dates. It is shown that unforced idle time only needs to be considered on the second machine. This result is then used to extend a lower bound and dominance conditions for the single-machine problem to the two-machine permutation flow shop problem. Two branch-and-bound algorithms are developed for the problem utilizing the lower bound and dominance conditions. The algorithms are tested using instances that represent a wide variety of conditions. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/12164
dc.identifier.uri http://dx.doi.org/10.1016/j.cor.2019.04.017 en
dc.language eng en
dc.rights info:eu-repo/semantics/openAccess en
dc.title Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed en
dc.type Publication en
dc.type article en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
P-00Q-GGZ.pdf
Size:
645.72 KB
Format:
Adobe Portable Document Format
Description: