The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
From MaRDI portal
Publication:5962398
Recommendations
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
Cited in
(29)- A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
- Single machine weighted earliness-tardiness penalty problem with a common due date
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- scientific article; zbMATH DE number 5151903 (Why is no real title available?)
- AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem
- EA/G-GA for single machine scheduling problems with earliness/tardiness costs
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
- scientific article; zbMATH DE number 3904315 (Why is no real title available?)
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
- A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
- A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
- A comparison of lower bounds for the single-machine early/tardy problem
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
- Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date
- A branch and bound approach for single machine scheduling with earliness and tardiness penalties
- New exact algorithms for one-machine earliness-tardiness scheduling
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
- Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- The one-machine problem with earliness and tardiness penalties
This page was built for publication: The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962398)
