Minmax scheduling problems with common due-date and completion time penalty
From MaRDI portal
Publication:2424794
DOI10.1007/s10878-018-0365-8zbMath1423.90095WikidataQ128853407 ScholiaQ128853407MaRDI QIDQ2424794
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0365-8
scheduling; single machine; minmax; common due-date; position-dependent processing times; job-rejection
Related Items
Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects, Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine, Single machine lot scheduling with optional job-rejection, Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads, Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times, A note on the single machine CON and CONW problems with lot scheduling, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms, Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
Cites Work
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- Scheduling a deteriorating maintenance activity and due-window assignment
- Single-machine scheduling with precedence constraints and position-dependent processing times
- A survey on offline scheduling with rejection
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- Minmax scheduling problems with a common due-window
- Single machine scheduling and due date assignment with positionally dependent processing times
- Single-machine scheduling with learning considerations
- Multiple-machine scheduling with earliness, tardiness and completion time penalties
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Single machine group scheduling with position dependent processing times and ready times
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- Single machine scheduling with precedence constraints and positionally dependent processing times
- Proportionate flowshops with general position-dependent processing times
- Scheduling with release times and rejection on two parallel machines
- A survey on scheduling problems with due windows
- Common due window size and location determination in a single machine scheduling problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- A due-window assignment problem with position-dependent processing times
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Multiagent Scheduling