The mixed shop scheduling problem

DOI10.1016/S0166-218X(85)80007-XMaRDI QIDQ1067989zbMATH OpenOpenAlexFDO

Authors Teruo Masuda, Hiroaki Ishii, Toshio Nishida

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

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

Review text

The two-machine shop scheduling problem has been solved by Johnson and Gonzalez/Sahni if the jobs are flow shop type and open shop type, respectively. The authors develop a solution procedure where both job types occur. While this problem has been solved by Jackson for given processing orders of the two machines, the new procedure allows the flexibility of the processing order.

Recommendations

• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
• Complexity of mixed shop scheduling problems: A survey
• Two-machine mixed shop problem with setup, processing and removal time separated
• Two machine mixed 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

Cited in

(18)

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• Scheduling two jobs with fixed and nonfixed routes
• A scheduling problem in a semi-open job shop -- the case of a cordset manufacturing company
• Job-shop scheduling with processing alternatives.
• An effective heuristic algorithm for the partial shop scheduling problem
• Two machine mixed shop scheduling problem with controllable machine speeds
• 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
• A complete 4-parametric complexity classification of short shop scheduling problems
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• 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
• scientific article; zbMATH DE number 4099024 (Why is no real title available?)
• A new three-machine shop scheduling: complexity and approximation algorithm
• Two-Machine Super-Shop Scheduling Problem
• Inhomogeneous deterministic two-stage queueing systems
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM

This page was built for publication: The mixed shop scheduling problem

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