Complexity of Scheduling Shops with No Wait in Process
From MaRDI portal
Publication:3880561
DOI10.1287/moor.4.4.448zbMath0438.90039OpenAlexW1964580560MaRDI QIDQ3880561
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
schedulingflow shopjob shopNP-hard problemsopen shopsno wait in processjob-machine schedulingmakespan modelstwo processor flow shop problem
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Some no-wait shops scheduling problems: Complexity aspect, The two-machine no-wait general and proportionate open shop makespan problem, Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, The proportionate two-machine no-wait job shop scheduling problem, Lot sizing in a no-wait flow shop, Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival, Two-stage no-wait scheduling models with setup and removal times separated, On a scheduling problem in a robotized analytical system, The Open Shop Scheduling Problem, FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC, On Eulerian extensions and their application to no-wait flowshop scheduling, Approximative procedures for no-wait job shop scheduling., A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem, Unnamed Item, Four decades of research on the open-shop scheduling problem to minimize the makespan, 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, NP-hardness of compact scheduling in simplified open and flow shops., Inapproximability results for no-wait job shop scheduling., Scheduling two-machine no-wait open shops to minimize makespan, An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach, Coupled task scheduling with exact delays: literature review and models, Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds, Complete local search with limited memory algorithm for no-wait job shops to minimize makespan, A two-machine no-wait flow shop problem with two competing agents, Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing, SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS, The complexity of scheduling jobs in repetitive manufacturing systems
