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

DOI10.1080/02522667.1997.10699309MaRDI QIDQ4354087zbMATH OpenOpenAlexFDO

Authors Tapan Sen, Farhad M. E. Raiszadeh

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)

Recommendations

• The two-machine flowshop scheduling problem with total tardiness
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• Minimizing tardiness in a two-machine flow-shop
• Minimising Maximum Lateness in a Two-Machine Flowshop
• scientific article; zbMATH DE number 1247725

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Minimising the Maximum Penalty in the Two-Machine Flow Shop
• 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
• Optimal two- and three-stage production schedules with set-up time included

Cited in

(11)

• Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
• Minimizing the total flow time and the tardiness in a two-machine flow shop
• The two-machine flowshop scheduling problem with total tardiness
• A note on minimizing maximum lateness in a two-machine no-wait flowshop
• Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm
• A new sufficient condition of optimality for the two-machine flowshop problem
• Minimising Maximum Lateness in a Two-Machine Flowshop
• Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
• Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
• An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
• Job lateness in a two-machine flowshop with setup times separated

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354087)