New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
From MaRDI portal
Publication:2424773
DOI10.1016/j.ejor.2019.04.022zbMath1430.90272OpenAlexW2940786803WikidataQ128008922 ScholiaQ128008922MaRDI QIDQ2424773
Christos P. Koulamas, Kyparisis, George J.
Publication date: 25 June 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.04.022
Related Items (5)
Due-window assignment scheduling with past-sequence-dependent setup times ⋮ Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times ⋮ Due-window assignment scheduling with job-rejection, truncated learning effects and setup times ⋮ Due date assignment scheduling with positional-dependent weights and proportional setup times ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
- Single machine scheduling with past-sequence-dependent setup times and learning effects
- Single-machine scheduling against due dates with past-sequence-dependent setup times
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
- A survey of scheduling problems with setup times or costs
- Single-machine scheduling problems with past-sequence-dependent setup times
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- Dominance and Decomposition Heuristics for Single Machine Scheduling
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Reducibility among Combinatorial Problems
- New Precedence Theorems for One-Machine Weighted Tardiness
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
This page was built for publication: New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
