Single-machine scheduling against due dates with past-sequence-dependent setup times
From MaRDI portal
Publication:933538
DOI10.1016/j.ejor.2007.08.028zbMath1147.90010OpenAlexW2028165888MaRDI QIDQ933538
Publication date: 21 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://pub.uni-bielefeld.de/record/2315660
Related Items (20)
Due-window assignment scheduling with past-sequence-dependent setup times ⋮ A survey on scheduling problems with due windows ⋮ Scheduling jobs with general truncated learning effects including proportional setup times ⋮ Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence ⋮ Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect ⋮ Due-window assignment scheduling with job-rejection, truncated learning effects and setup times ⋮ Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times ⋮ New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives ⋮ Single machine scheduling with a general exponential learning effect ⋮ Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption ⋮ Due date single machine scheduling problems with nonlinear deterioration and learning effects and past sequence dependent setup times ⋮ A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time ⋮ Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects ⋮ Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times ⋮ Minimizing the total completion time in a single-machine scheduling problem with a learning effect ⋮ Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects ⋮ Due date assignment scheduling with positional-dependent weights and proportional setup times
Cites Work
- Unnamed Item
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single-machine scheduling problems with past-sequence-dependent setup times
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
This page was built for publication: Single-machine scheduling against due dates with past-sequence-dependent setup times