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.069zbMATH Open1443.90041OpenAlexW2074384335MaRDI QIDQ2285347FDOQ2285347
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
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
branch-and-bound algorithmgroup schedulingLagrangian relaxationtime-indexed formulationsequence-dependent setup timeminimization of earliness and tardiness
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)
Cites Work
- Scheduling with batching: A review
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Scheduling. Theory, algorithms, and systems.
- An exact algorithm for single-machine scheduling without machine idle time
- Single-machine group scheduling with general deterioration and learning effects
- On the Complexity of Scheduling with Batch Setup Times
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Batch scheduling to minimize total completion time
- Near-optimal solutions of large-scale single-machine scheduling problems
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- Earliness-tardiness scheduling with setup considerations
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Time-indexed formulations and the total weighted tardiness problem
- New exact algorithms for one-machine earliness-tardiness scheduling
- A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
- A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Optimal timing schedules in earliness-tardiness single machine sequencing
- Single machine scheduling with batch set-up times to minimize maximum lateness
- Single machine scheduling with symmetric earliness and tardiness penalties
Cited In (12)
- Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain
- A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Optimal due date assignment without restriction and convex resource allocation in group technology scheduling
- Two-stage assembly scheduling problem for minimizing total tardiness with setup times
- Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- When serial batch scheduling involves parallel batching decisions: a branch and price scheme
- An optimization model with a Lagrangian relaxation algorithm for artificial Internet of things-enabled sustainable circular supply chain networks
- On optimal due date assignment without restriction and resource allocation in group technology scheduling
- A single machine group scheduling problem with due date assignment and position-dependent costs
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
Uses Software
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)
