An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds

DOI10.1287/IJOC.8.4.376MaRDI QIDQ4367053zbMATH OpenOpenAlexFDO

Authors Stan Van Hoesel, Albert P. M. Wagelmans, Mario van Vliet

Publication date 14 January 1998

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.8.4.376

zbMATH Keywords

dominance relationtwo-machine flow shopvarying machine speeds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• Time complexity and linear-time approximation of the ancient two-machine flow shop
• Two machine mixed shop scheduling problem with controllable machine speeds
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times

Cited in

(7)

• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
• Two machine mixed shop scheduling problem with controllable machine speeds
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Single machine scheduling with controllable release and processing parameters
• Two-machine open shop problem with controllable processing times
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions

This page was built for publication: An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds

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