Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
From MaRDI portal
Publication:2462548
DOI10.1016/j.cor.2006.10.003zbMath1139.90013MaRDI QIDQ2462548
Juan Diego Velásquez, Reha Uzsoy
Publication date: 30 November 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.10.003
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C39: Dynamic programming
Related Items
A simulated annealing approach to minimize the maximum lateness on uniform parallel machines, Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, Parallel machine scheduling with precedence constraints and setup times, A simulated annealing algorithm for single machine scheduling problems with family setups, A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups, Single-machine scheduling with advanced process control constraints
Cites Work
- Unnamed Item
- The one-machine sequencing problem
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- Scheduling two job classes on a single machine
- Single machine scheduling with batch set-up times to minimize maximum lateness
- Minimizing maximum lateness with job families
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Computer-Aided complexity classification of combinational problems
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
- 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
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Scheduling Groups of Jobs on a Single Machine
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints