An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem

DOI10.1007/978-1-4614-1123-9_2MaRDI QIDQ2958666zbMATH OpenOpenAlexFDO

Authors Shunji Tanaka

Publication date 3 February 2017

Published in Just-in-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-1123-9_2

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• New exact algorithms for one-machine earliness-tardiness scheduling
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties

Cites work

• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• A branch and bound procedure to minimize mean absolute lateness on a single processor
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• A dynamic programming method for single machine scheduling
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• A polyhedral approach to single-machine scheduling problems.
• A time indexed formulation of non-preemptive single machine scheduling problems
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• An exact algorithm for single-machine scheduling without machine idle time
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• New exact algorithms for one-machine earliness-tardiness scheduling
• Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
• Optimal timing of a sequence of tasks with general completion costs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemption in single machine earliness/tardiness scheduling
• Single-machine scheduling with early and tardy completion costs
• State-space relaxation procedures for the computation of bounds to routing problems
• The one-machine problem with earliness and tardiness penalties
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Using short-term memory to minimize the weighted number of late jobs on a single machine.

Cited in

(10)

• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
• An iterative dynamic programming approach for the temporal knapsack problem
• An exact algorithm for single-machine scheduling without machine idle time
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• An exact algorithm for the precedence-constrained single-machine scheduling problem
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
• EA/G-GA for single machine scheduling problems with earliness/tardiness costs

This page was built for publication: An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958666)