Single machine scheduling with assignable due dates
From MaRDI portal
Publication:1613425
DOI10.1016/S0166-218X(01)00316-XzbMath1019.90024MaRDI QIDQ1613425
Gang Yu, Xiangtong Qi, Jonathan F. Bard
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
computational complexitysingle machine schedulingNP-completegeneralized due datesassignment of due datesassignment of release times
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Complexity and performance of numerical algorithms (65Y20)
Related Items
A greedy heuristic for solving scheduling problems with bounded rejection cost, Job sequencing and due date assignment in a single machine shop with uncertain processing times, A note: minmax due-date assignment problem with lead-time cost, Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals, Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, Maximizing total early work in a distributed two‐machine flow‐shop, Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity, Single machine scheduling with assignable due dates to minimize maximum and total late work, Order acceptance and scheduling with delivery under generalized parameters, Two-agent single-machine scheduling with assignable due dates, Batch scheduling of deteriorating reworkables, Unary NP-hardness of minimizing total weighted tardiness with generalized due dates, Minimizing total late work on a single machine with generalized due-dates, Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time, Strong NP-hardness of minimizing total deviation with generalized and periodic due dates, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms, Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates, Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates, The single-machine total tardiness scheduling problem: review and extensions, Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Survey of scheduling research involving due date determination decisions
- On the complexity of generalized due date scheduling problems
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- Single machine scheduling with batch deliveries
- Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
- Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- Batch scheduling and common due date assignment problem: An NP-hard case
- Processing-plus-wait due dates in single-machine scheduling
- Batch scheduling and common due-date assignment on a single machine
- Sequencing with Earliness and Tardiness Penalties: A Review
- Scheduling with Fixed Delivery Dates
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
