The mixed shop scheduling problem

DOI10.1016/S0166-218X(85)80007-XzbMath0579.90053OpenAlexW2048153410MaRDI QIDQ1067989

Toshio Nishida, Teruo Masuda, Hiroaki Ishii

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(85)80007-x

zbMATH Keywords

flow shopopen shoptwo-machine shop scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

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 ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival ⋮ Inhomogeneous deterministic two-stage queueing systems ⋮ A new three-machine shop scheduling: complexity and approximation algorithm ⋮ Job-shop scheduling with processing alternatives. ⋮ A complete 4-parametric complexity classification of short shop scheduling problems ⋮ Complexity of mixed shop scheduling problems: A survey ⋮ Complexity of shop-scheduling problems with fixed number of jobs: a survey ⋮ METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM ⋮ Approximation algorithms for the three-machine proportionate mixed shop scheduling ⋮ Two machine mixed shop scheduling problem with controllable machine speeds ⋮ Scheduling two jobs with fixed and nonfixed routes

Cites Work

• Optimal two- and three-stage production schedules with setup times included
• Open Shop Scheduling to Minimize Finish Time