An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system

DOI10.1080/02522667.1997.10699309zbMath0886.90087OpenAlexW2032886681MaRDI QIDQ4354087

Farhad M. E. Raiszadeh, Tapan Sen

Publication date: 23 April 1998

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

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

zbMATH Keywords

branch-and-boundmaximum lateness of jobsminimizing flowtimetwo-machine flowshop system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

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

Cites Work

• Unnamed Item
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• 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

This page was built for publication: An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system