Unit Execution Time Shop Problems
From MaRDI portal
Publication:3965898
DOI10.1287/moor.7.1.57zbMath0499.90047OpenAlexW2159506517MaRDI QIDQ3965898
Publication date: 1982
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.7.1.57
NP-complete problemsflow shopjob shoppreemptive and nonpreemptive schedulesm machine open shopn independent jobsoptimal mean finishing time
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Some no-wait shops scheduling problems: Complexity aspect, On the complexity of preemptive openshop scheduling problems, The two-machine no-wait general and proportionate open shop makespan problem, A linear time approximation algorithm for movement minimization in conveyor flow shop processing, Using mixed graph coloring to minimize total completion time in job shop scheduling, 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, A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach, Open shop problems with unit time operations, On minimizing the weighted number of late jobs in unit execution time open-shops., Complexity, bounds and dynamic programming algorithms for single track train scheduling, Four decades of research on the open-shop scheduling problem to minimize the makespan, Some new results in flow shop scheduling, Fitness landscape analysis for the no-wait flow-shop scheduling problem, On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem, Scheduling two-machine no-wait open shops to minimize makespan, Scheduling ordered open shops, Minimizing total completion time in two-machine flow shops with exact delays, Minimizing the weighted number of late jobs in UET open shops, A polynomial algorithm for an open shop problem with unit processing times and tree constraints, Two-machine shop scheduling with zero and unit processing times, Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays, On the complexity of preemptive open-shop scheduling problems
