A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties

DOI10.1016/J.APM.2015.01.069MaRDI QIDQ2285347zbMATH OpenOpenAlexFDO

Authors Taha Keshavarz, Nasser Salmasi, Martin W. P. Savelsbergh

Publication date 8 January 2020

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2015.01.069

zbMATH Keywords

branch-and-bound algorithmgroup schedulingLagrangian relaxationtime-indexed formulationsequence-dependent setup timeminimization of earliness and tardiness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Recommendations

• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness

Cites work

• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
• An exact algorithm for single-machine scheduling without machine idle time
• An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
• Batch scheduling to minimize total completion time
• Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
• Earliness-tardiness scheduling with setup considerations
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• Near-optimal solutions of large-scale single-machine scheduling problems
• New exact algorithms for one-machine earliness-tardiness scheduling
• On the Complexity of Scheduling with Batch Setup Times
• Optimal timing schedules in earliness-tardiness single machine sequencing
• Scheduling with batching: A review
• Scheduling. Theory, algorithms, and systems.
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Single machine scheduling with symmetric earliness and tardiness penalties
• Single-machine group scheduling with general deterioration and learning effects
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Time-indexed formulations and the total weighted tardiness problem

Cited in

(13)

• A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme
• Optimal due date assignment without restriction and convex resource allocation in group technology scheduling
• An optimization model with a Lagrangian relaxation algorithm for artificial Internet of things-enabled sustainable circular supply chain networks
• Two-stage assembly scheduling problem for minimizing total tardiness with setup times
• On optimal due date assignment without restriction and resource allocation in group technology scheduling
• Sequence-dependent scheduling with order deliveries
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
• A single machine group scheduling problem with due date assignment and position-dependent costs
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
• Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties

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