The two-machine flowshop scheduling problem with total tardiness

DOI10.1016/0305-0548(89)90005-1zbMath0664.90042MaRDI QIDQ1115798

Jatinder N. D. Gupta, Tapan Sen, Parthasarati Dileepan

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90005-1

zbMATH Keywords

branch-and-bound; heuristic; two-machine flowshop; total job tardiness

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90B35: Deterministic scheduling theory in operations research

Related Items

Two-machine flowshop scheduling to minimize total tardiness, A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness, Minimizing tardiness in a two-machine flow-shop, A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems, Minimizing total tardiness in permutation flowshops, A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops, A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, Note on minimizing total tardiness in a two-machine flowshop

Cites Work

• Unnamed Item
• Unnamed Item
• On two-machine scheduling with release and due dates to minimize maximum lateness
• A decomposition algorithm for the single machine total tardiness problem
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• A dual algorithm for the one-machine scheduling problem
• Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness