The two-machine open shop problem: To fit or not to fit, that is the question

DOI10.1016/S0167-6377(03)00018-XMaRDI QIDQ1811630zbMATH OpenOpenAlexFDO

Authors Marjan Van Den Akker, Han Hoogeveen, Gerhard J. Woeginger

Publication date 17 June 2003

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6377(03)00018-x

zbMATH Keywords

bicriterion optimizationflow shop schedulingopen shop schedulingschedulingsequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 5260089
• Two-machine open shop scheduling with an availability constraint
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• Two machine open shop scheduling problems with bi-criteria
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS

Cites work

• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function

Cited in

(5)

• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• The open shop scheduling problem
• Two-agent scheduling in a two-machine open shop
• Reentrant open shop scheduling problem with time lags and no-wait constraints

This page was built for publication: The two-machine open shop problem: To fit or not to fit, that is the question

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