A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
From MaRDI portal
Publication:2770081
DOI10.1287/opre.47.1.113zbMath0979.90030OpenAlexW2138898223MaRDI QIDQ2770081
S. David Wu, Eui-Seok Byeon, Robert H. Storer
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.47.1.113
branch-and-bound algorithmdecomposition methodscheduling decisionsrandom shop disturbancesweighted tardiness job-shop scheduling
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Queues and service in operations research (90B22)
Related Items
A robust approach for the single machine scheduling problem ⋮ Executing production schedules in the face of uncertainties: a review and some future directions ⋮ Parallel Machine Scheduling with Uncertain Communication Delays ⋮ An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments ⋮ Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns ⋮ Schedule execution for two-machine flow-shop with interval processing times ⋮ Risk measure of job shop scheduling with random machine breakdowns ⋮ Optimizing makespan and stability risks in job shop scheduling ⋮ Sensitivity bounds for machine scheduling with uncertain communication delays ⋮ Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems ⋮ Dynamic surgery management under uncertainty ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Extended GRASP for the job shop scheduling problem with total weighted tardiness objective ⋮ On the optimality conditions of the two-machine flow shop problem ⋮ New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing ⋮ Maximization of solution flexibility for robust shop scheduling ⋮ A theoretic and practical framework for scheduling in a stochastic environment ⋮ Solve-and-robustify ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case ⋮ An extended enterprise planning methodology for the discrete manufacturing industry ⋮ A new sufficient condition of optimality for the two-machine flowshop problem ⋮ Decomposition methods for large job shops
Uses Software
