Two-Machine Super-Shop Scheduling Problem

DOI10.1057/JORS.1991.96MaRDI QIDQ3978740zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

flow-shopjob-shopmakespanmixed-shopopen-shoppolynomial algorithmtwo-machine super-shop

Mathematics Subject Classification ID

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

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

Cited in

(10)

• Scheduling two jobs with fixed and nonfixed routes
• Complexity of mixed shop scheduling problems: A survey
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• 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
• The three-machine proportionate open shop and mixed shop minimum makespan problems
• A new three-machine shop scheduling: complexity and approximation algorithm
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
• Isomorphic scheduling problems

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)