Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
From MaRDI portal
(Redirected from Publication:1793403)
Summary: This paper addresses the problem of scheduling \(n\) independent jobs on a single machine with a fixed unavailability interval, where the aim is to minimize the total earliness and tardiness (TET) about a common due date. Two exact methods are proposed for solving the problem: mixed integer linear programming formulations and a dynamic programming based method. These methods are coded and tested intensively on a large data set and the results are analytically compared. Computational experiments show that the dynamic programming method is efficient in obtaining the optimal solutions and no problems due to memory requirement.
Recommendations
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
- Minimizing total weighted late work on a single-machine with non-availability intervals
Cites work
- A single machine scheduling problem with availability constraints and sequence-dependent setup costs
- A survey of the state-of-the-art of common due date assignment and scheduling research
- An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
- Current trends in deterministic scheduling
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 31717 (Why is no real title available?)
- Makespan minimization for parallel machines scheduling with multiple availability constraints
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
- Minimizing mean absolute deviation of completion times about a common due date
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints
- Minimizing total completion time on a single machine with a flexible maintenance activity
- New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel-machine scheduling with non-simultaneous machine available time
- Scheduling a deteriorating maintenance activity on a single machine
- Scheduling around a small common due date
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Scheduling with limited machine availability
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities
Cited in
(7)- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
This page was built for publication: Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793403)
