Two-machine flow shop scheduling with nonregular criteria

DOI10.1023/B:JMMA.0000036573.01968.1bzbMath1087.90029OpenAlexW2025426217WikidataQ57633935 ScholiaQ57633935MaRDI QIDQ702362

Jatinder N. D. Gupta, Frank Werner, Volker Lauff

Publication date: 17 January 2005

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jmma.0000036573.01968.1b

zbMATH Keywords

branch and boundflow shopSchedulingcommon due dateenumerative algorithmnon-regular criterion

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem

This page was built for publication: Two-machine flow shop scheduling with nonregular criteria