The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

DOI10.1590/S1807-03022010000200002zbMATH Open1201.90085OpenAlexW2027120502MaRDI QIDQ5962398FDOQ5962398

Authors: Débora P. Ronconi, Márcio S. Kawamura 

Publication date: 22 September 2010

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1590/s1807-03022010000200002

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

zbMATH Keywords

lower boundsingle machinebranch-and-boundcommon due dateearliness and tardiness

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cited In (29)

• 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
• The one-machine problem with earliness and tardiness penalties
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• New exact algorithms for one-machine earliness-tardiness scheduling
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• 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
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
• A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
• A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Title not available (Why is that?)
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• Trade-off solutions in a single-machine scheduling problem for minimizing total earliness and maximum tardiness
• Single machine weighted earliness-tardiness penalty problem with a common due date
• Title not available (Why is that?)
• A comparison of lower bounds for the single-machine early/tardy problem
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
• New Lower and Upper Bounds for Scheduling Around a Small 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
• 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

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)