The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
From MaRDI portal
Publication:4838077
DOI10.1287/mnsc.41.1.94zbMath0824.90076OpenAlexW2011769265MaRDI QIDQ4838077
Egon Balas, Jan Karel Lenstra, Alkis A. Vazacopoulos
Publication date: 4 July 1995
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.41.1.94
job shop schedulingshifting bottleneck procedureone machine schedulingdelayed precedence constraintslongest tail heuristicminimum makespan objectiverelease and delivery times
Related Items
Hybrid simulated annealing with memory: an evolution-based diversification approach, A multi-criteria approach for scheduling semiconductor wafer fabrication facilities, Job shop scheduling with setup times, deadlines and precedence constraints, Adaptive temperature control for simulated annealing: a comparative study, One-machine generalized precedence constrained scheduling problems, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, A bi-objective approach for scheduling ground-handling vehicles in airports, An improved heuristic for one-machine scheduling with delays constraints, A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags, An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints, On the representation of the one machine sequencing problem in the shifting bottleneck heuristic, Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication, Minimum equivalent precedence relation systems, A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times, Job-shop scheduling: Computational study of local search and large-step optimization methods, Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound., A note on the shifting bottleneck procedure for job shop scheduling, An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective, Study on constraint scheduling algorithm for job shop problems with multiple constraint machines, CONFLICT IDENTIFICATION AND RECONCILIATION IN A COLLABORATIVE MANUFACTURING SCHEDULING TASK, Ant colony optimization combined with taboo search for the job shop scheduling problem, Unnamed Item, An integer programming approach to optimal basic block instruction scheduling for single-issue processors, Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches, Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay., Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search, Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study, Deterministic job-shop scheduling: Past, present and future, A lower bound for the job insertion problem., Extending the shifting bottleneck procedure to real-life applications, The job shop scheduling problem: Conventional and new solution techniques, The generalized shifting bottleneck procedure, Measures of subproblem criticality in decomposition algorithms for shop scheduling, Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags, Decomposition methods for reentrant flow shops with sequence-dependent setup times, A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags, Benchmarks for shop scheduling problems, Applying machine based decomposition in 2-machine flow shops, The nonpermutation flowshop scheduling problem: adjustment and bounding procedures, Decomposition methods for large job shops, A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
Uses Software
