Preemption in single machine earliness/tardiness scheduling

DOI10.1007/s10951-007-0028-6zbMath1168.90427OpenAlexW2047571228MaRDI QIDQ835565

Kerem Bülbül, Philip M. Kaminsky, Candace Arai Yano

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0028-6

zbMATH Keywords

single-machine schedulingearlinesstransportation problemtardinesspreemption

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, Temporal linear relaxation in IBM ILOG CP optimizer, Fast neighborhood search for the single machine earliness-tardiness scheduling problem, An exact extended formulation for the unrelated parallel machine total weighted completion time problem, A multi-objective optimization for preemptive identical parallel machines scheduling problem, A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem, Scheduling with time-dependent discrepancy times, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, A linear programming-based method for job shop scheduling, An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective, Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure, Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties, Resource constrained project scheduling subject to due dates: preemption permitted with penalty, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems, Modeling single machine preemptive scheduling problems for computational efficiency, The one-machine just-in-time scheduling problem with preemption, A new model for the preemptive earliness-tardiness scheduling problem, A gravitational task model with arbitrary anchor points for target sensitive real-time applications, Non-approximability of just-in-time scheduling, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Multicriteria scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
• Minimizing average completion time in the presence of release dates
• A heuristic for single machine scheduling with early and tardy costs
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution
• A decomposition algorithm for the single machine total tardiness problem
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Single machine scheduling with symmetric earliness and tardiness penalties
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• The one-machine problem with earliness and tardiness penalties
• A branch and bound procedure to minimize mean absolute lateness on a single processor
• Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
• Scheduling with Deadlines and Loss Functions
• The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness