Single-machine common due date total earliness/tardiness scheduling with machine unavailability
DOI10.1007/s10951-018-0585-xzbMath1430.90247OpenAlexW2891075930MaRDI QIDQ2286433
Kerem Bülbül, Safia Kedad-Sidhoum, Halil Şen
Publication date: 22 January 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-018-0585-x
dynamic programmingcommon due datemaintenancesingle-machineearliness/tardinessmachine unavailability\( \mathcal{NP} \)-completenon-resumableresumablesemi-resumableunrestrictive
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
- Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Single-machine scheduling with periodic maintenance to minimize makespan
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Single machine flow-time scheduling with a single breakdown
- Scheduling around a small common due date
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan on a single machine with flexible maintenances and jobs' release dates
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
- Scheduling with limited machine availability
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- Single machine scheduling with small operator-non-availability periods
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Machine scheduling with an availability constraint
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing mean absolute deviation of completion times about a common due date
- Single- and multiple-processor models for minimizing completion time variance
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- On scheduling with ready-times, due-dates and vacations
- Stochastic Scheduling with Variable Profile and Precedence Constraints
- Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs
- Scheduling Position-Dependent Maintenance Operations
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
This page was built for publication: Single-machine common due date total earliness/tardiness scheduling with machine unavailability