Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
From MaRDI portal
Publication:4394265
DOI10.1080/00207549408956998zbMath0901.90132OpenAlexW2048970339MaRDI QIDQ4394265
Publication date: 11 June 1998
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549408956998
branch-and-boundsingle machinesequence-dependent setup timesmaximum latenessrolling horizon heuristics
Related Items
Parameter-free sampled fictitious play for solving deterministic dynamic programming problems ⋮ A rolling window optimization method for large-scale WCDMA base stations planning problem ⋮ Executing production schedules in the face of uncertainties: a review and some future directions ⋮ Scheduling of multi-spindle CNC gantry mills ⋮ An efficient two-stage algorithm for decentralized scheduling of micro-CHP units ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops ⋮ A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan ⋮ Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events ⋮ A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families ⋮ Semiconductor final-test scheduling under setup operator constraints ⋮ A two‐step optimization model for the distribution of perishable products ⋮ Aversion scheduling in the presence of risky jobs ⋮ Adaptive scheduling and tool flow control in flexible job shops ⋮ A linear programming-based method for job shop scheduling ⋮ A branch and bound method for the job-shop problem with sequence-dependent setup times ⋮ Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times ⋮ Unnamed Item ⋮ Analysis of reactive scheduling problems in a job shop environment ⋮ A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups ⋮ Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches ⋮ Scheduling batch processing machines with incompatible job families ⋮ Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times ⋮ In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations ⋮ Performance analysis of assembly systems with unreliable machines and finite buffers ⋮ An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production ⋮ A review of planning and scheduling systems and methods for integrated steel production ⋮ A survey of dynamic scheduling in manufacturing systems ⋮ Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem ⋮ A bicriteria scheduling with sequence-dependent setup times ⋮ A Progressive Hedging Approach for Surgery Planning Under Uncertainty ⋮ Scheduling of tasks with effectiveness precedence constraints ⋮ Capacity-constrained scheduling for a logic IC final test facility ⋮ Decomposition methods for reentrant flow shops with sequence-dependent setup times ⋮ Job-shop scheduling with blocking and no-wait constraints ⋮ Decomposition methods for large job shops ⋮ Using real time information for effective dynamic scheduling ⋮ A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
Cites Work
- The one-machine sequencing problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- Minimizing maximum lateness on one machine: computational experience and some applications
- P-Complete Approximation Problems
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- On the Complexity of Scheduling with Batch Setup Times
- Sequencing with due-dates and early start times to minimize maximum tardiness
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
