Complexity of Scheduling Shops with No Wait in Process

DOI10.1287/MOOR.4.4.448MaRDI QIDQ3880561zbMATH OpenOpenAlexFDO

Authors Yookun Cho, Sartaj Sahni

Publication date 1979

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.4.4.448

zbMATH Keywords

flow shopjob shopjob-machine schedulingmakespan modelsno wait in processNP-hard problemsopen shopsschedulingtwo processor flow shop problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(37)

• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• Some no-wait shops scheduling problems: Complexity aspect
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• The complexity of scheduling jobs in repetitive manufacturing systems
• Two-stage no-wait scheduling models with setup and removal times separated
• Approximative procedures for no-wait job shop scheduling.
• Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
• Lot sizing in a no-wait flow shop
• On a scheduling problem in a robotized analytical system
• A two-machine no-wait flow shop problem with two competing agents
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Coupled task scheduling with exact delays: literature review and models
• On Eulerian extensions and their application to no-wait flowshop scheduling
• No-wait job shop scheduling: tabu search and complexity of subproblems
• An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
• An evolutionary approach to rehabilitation patient scheduling: A case study
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• The two-machine no-wait general and proportionate open shop makespan problem
• The proportionate two-machine no-wait job shop scheduling problem
• The open shop scheduling problem
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC
• scientific article; zbMATH DE number 1279216 (Why is no real title available?)
• Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
• NP-hardness of compact scheduling in simplified open and flow shops.
• Computational complexity and algorithms for two scheduling problems under linear constraints
• On the NP-hardness of two scheduling problems under linear constraints
• Reentrant open shop scheduling problem with time lags and no-wait constraints
• Fifty years of research in scheduling -- theory and applications
• On the inapproximability of two-machine open shop scheduling with exact delays
• The impact of missing operations on the flow shop: permutation \textit{vs}. non permutation modes
• Inapproximability results for no-wait job shop scheduling.
• Scheduling two-machine no-wait open shops to minimize makespan
• On the inapproximability of two-machine open shop scheduling with exact delays
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem

This page was built for publication: Complexity of Scheduling Shops with No Wait in Process

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