Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
From MaRDI portal
(Redirected from Publication:4394265)
Recommendations
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
- Minimizing L max for the single machine scheduling problem with family set-ups
- scientific article; zbMATH DE number 1416517
Cites work
- scientific article; zbMATH DE number 3908167 (Why is no real title available?)
- scientific article; zbMATH DE number 3708086 (Why is no real title available?)
- scientific article; zbMATH DE number 35511 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Minimizing maximum lateness on one machine: computational experience and some applications
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- On the Complexity of Scheduling with Batch Setup Times
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- P-Complete Approximation Problems
- Sequencing with due-dates and early start times to minimize maximum tardiness
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- The one-machine sequencing problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
Cited in
(45)- Scheduling of multi-spindle CNC gantry mills
- Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- 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
- Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem
- Job-shop scheduling with blocking and no-wait constraints
- Executing production schedules in the face of uncertainties: a review and some future directions
- A survey of dynamic scheduling in manufacturing systems
- Scheduling of tasks with effectiveness precedence constraints
- A rolling window optimization method for large-scale WCDMA base stations planning problem
- Aversion scheduling in the presence of risky jobs
- A linear programming-based method for job shop scheduling
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- A bicriteria scheduling with sequence-dependent setup times
- Semiconductor final-test scheduling under setup operator constraints
- A progressive hedging approach for surgery planning under uncertainty
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
- An efficient two-stage algorithm for decentralized scheduling of micro-CHP units
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- Adaptive scheduling and tool flow control in flexible job shops
- scientific article; zbMATH DE number 1271322 (Why is no real title available?)
- Scheduling batch processing machines with incompatible job families
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- Capacity-constrained scheduling for a logic IC final test facility
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations
- Analysis of reactive scheduling problems in a job shop environment
- A review of planning and scheduling systems and methods for integrated steel production
- A two‐step optimization model for the distribution of perishable products
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
- Scheduling in manufacturing with transportation: classification and solution techniques
- Job scheduling integrated with material ordering: decision-dependent stochastic programming and information relaxation dual bounds
- A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance
- 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
- Capacity planning in long-term care facilities: a multi-period mathematical model with interfacility transfers
- 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 genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- A branch and bound method for the job-shop problem with sequence-dependent setup times
This page was built for publication: Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394265)
