TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES

DOI10.1142/S0217595909002432zbMath1180.90134MaRDI QIDQ3406723

No author found.

Publication date: 19 February 2010

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

uncertaintyschedulingmakespandominationflow-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Measures of problem uncertainty for scheduling with interval processing times ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ Optimal results and numerical simulations for flow shop scheduling problems ⋮ Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown ⋮ Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times

Cites Work

• Unnamed Item
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• Executing production schedules in the face of uncertainties: a review and some future directions
• Mean flow time minimization with given bounds of processing times
• Flowshop scheduling research after five decades
• A new sufficient condition of optimality for the two-machine flowshop problem
• Optimal two- and three-stage production schedules with setup times included
• Sequencing with uncertain numerical data for makespan minimisation
• Flowshop scheduling problem to minimize total completion time with random and bounded processing times
• Two-machine flowshop minimum-length scheduling problem with random and bounded processing times

This page was built for publication: TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES