Machine scheduling with earliness, tardiness and non-execution penalties

DOI10.1016/j.cor.2003.08.012zbMath1061.90045OpenAlexW2064028010MaRDI QIDQ1886873

Refael Hassin, Mati Shani

Publication date: 19 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.08.012

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry, Optimal restricted due date assignment in scheduling, Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem, Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties, Development of hybrid evolutionary algorithms for production scheduling of hot strip mill, Single CNC machine scheduling with controllable processing times and multiple due dates, Non-approximability of just-in-time scheduling, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Punctuality and idleness in just-in-time scheduling, Minimizing earliness and tardiness costs in stochastic scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• A V-shape property of optimal schedule of jobs about a common due date
• Equivalence of mean flow time problems and mean absolute deviation problems
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• Completion time variance minimization on a single machine is difficult
• The complexity of scheduling job families about a common due date
• A survey of the state-of-the-art of common due date assignment and scheduling research
• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• The weighted common due date single machine scheduling problem revisited
• Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• 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
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Computer-Aided complexity classification of combinational problems
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Earliness-Tardiness Scheduling Around Almost Equal Due Dates
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• Algorithms for minclique scheduling problems