Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm

DOI10.1080/02522667.2003.10699559zbMath1176.90259OpenAlexW1976390826MaRDI QIDQ4469135

Tapan Sen, Parthasarati Dileepan, Farhad M. E. Raiszadeh

Publication date: 14 June 2004

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2003.10699559

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Unnamed Item
• 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
• Minimising the Maximum Penalty in the Two-Machine Flow Shop
• An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system

This page was built for publication: Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm