Preemption in single machine earliness/tardiness scheduling
From MaRDI portal
Publication:835565
DOI10.1007/S10951-007-0028-6zbMATH Open1168.90427OpenAlexW2047571228MaRDI QIDQ835565FDOQ835565
Philip Kaminsky, Kerem Bülbül, 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
Recommendations
- The one-machine just-in-time scheduling problem with preemption
- Single machine scheduling to minimize weighted earliness subject to maximum tardiness
- Preemptive scheduling with deadlines on a single machine
- A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
- An exact approach to early/tardy scheduling with release dates
Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with deadlines and loss functions
- Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single-machine scheduling with early and tardy completion costs
- 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
- The one-machine problem with earliness and tardiness penalties
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
- 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
- Minimizing average completion time in the presence of release dates
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- Optimal timing schedules in earliness-tardiness single machine sequencing
- The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
- A branch and bound procedure to minimize mean absolute lateness on a single processor
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- A heuristic for single machine scheduling with early and tardy costs
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution
- 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
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Title not available (Why is that?)
Cited In (26)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- Scheduling with time-dependent discrepancy times
- Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Resource constrained project scheduling subject to due dates: preemption permitted with penalty
- Non-approximability of just-in-time scheduling
- Temporal linear relaxation in IBM ILOG CP optimizer
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
- 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
- The one-machine just-in-time scheduling problem with preemption
- Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- Modeling single machine preemptive scheduling problems for computational efficiency
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- A new model for the preemptive earliness-tardiness scheduling problem
- A gravitational task model with arbitrary anchor points for target sensitive real-time applications
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- A linear programming-based method for job shop scheduling
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- A multi-objective optimization for preemptive identical parallel machines scheduling problem
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Multicriteria scheduling
This page was built for publication: Preemption in single machine earliness/tardiness scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835565)
