scientific article; zbMATH DE number 3860868

MaRDI QIDQ3329200zbMATH OpenFDO

Authors Peter Brucker

Publication date 1984

zbMATH Keywords

flow-shopjob-shopopen-shopsurvey on complexity results

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Complexity of mixed shop scheduling problems: A survey
• The complexity of shop-scheduling problems with two or three jobs
• Scheduling ordered open shops
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• The complexity of cyclic shop scheduling problems

Cited in

(17)

• The complexity of shop-scheduling problems with two or three jobs
• On scheduling cycle shops: Classification, complexity and approximation
• The complexity of cyclic shop scheduling problems
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• On the hardness of the classical job shop problem
• Complexity of mixed shop scheduling problems: A survey
• Shop scheduling problems with pliable jobs
• A complete 4-parametric complexity classification of short shop scheduling problems
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• On complexity of optimal recombination for flowshop scheduling problems
• Complete Complexity Classification of Short Shop Scheduling
• Computer-Aided complexity classification of combinational problems
• On The Complexity Of The Process Shop
• Scheduling ordered open shops
• On the complexity of proportionate open shop and job shop problems
• Complexity results for flow shop problems with synchronous movement
• A note on the complexity of the concurrent open shop problem

This page was built for publication:

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