Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
From MaRDI portal
Publication:3904361
DOI10.1287/opre.29.3.511zbMath0455.90043OpenAlexW2000809807WikidataQ113239930 ScholiaQ113239930MaRDI QIDQ3904361
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.29.3.511
polynomial time algorithmflow shopopen shoprelease timespreemptive schedulingNP-hard problemsjob shopsindependent jobsdue times
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
On the complexity of preemptive openshop scheduling problems, Scheduling two-machine preemptive open shops to minimize total completion time, One machine scheduling problem with fuzzy duedates, A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Open shop problem with zero-one time operations and integer release date/deadline intervals, Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival, Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints, A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Open shop scheduling problems with late work criteria., An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., Unnamed Item, Complexity of mixed shop scheduling problems: A survey, On the complexity of generalized due date scheduling problems, Four decades of research on the open-shop scheduling problem to minimize the makespan, Some new results in flow shop scheduling, Conditions for the existence of continuous schedules of duration five, An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, On the open-shop problem with preemption and minimizing the average completion time, Scheduling preemptive open shops to minimize total tardiness, Two-machine open shop scheduling with an availability constraint, Scheduling ordered open shops, Network flow approaches to pre-emptive open-shop scheduling problems with time-windows, The job shop scheduling problem: Conventional and new solution techniques, Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop, Comparative approaches to equipment scheduling in high volume factories, On the complexity of preemptive open-shop scheduling problems, Branch and bound algorithm for the flow shop with multiple processors, A tabu search approach to machine scheduling
