Two-Machine Super-Shop Scheduling Problem

DOI10.1057/JORS.1991.96zbMATH Open0742.90047OpenAlexW2037726054MaRDI QIDQ3978740FDOQ3978740

Authors: V. A. Strusevich 

Publication date: 25 June 1992

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1991.96

Recommendations

• Shop scheduling problems under precedence constraints
• scientific article; zbMATH DE number 1008459
• The complexity of shop-scheduling problems with two or three jobs
• The mixed shop scheduling problem
• Flow shop and open shop scheduling with a critical machine and two operations per job

zbMATH Keywords

makespanpolynomial algorithmjob-shopflow-shopopen-shopmixed-shoptwo-machine super-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (10)

• Isomorphic scheduling problems
• Two-machine open-shop scheduling with rejection to minimize the makespan
• A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
• Scheduling two jobs with fixed and nonfixed routes
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Complexity of mixed shop scheduling problems: A survey
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
• A new three-machine shop scheduling: complexity and approximation algorithm

This page was built for publication: Two-Machine Super-Shop Scheduling Problem

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