Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
From MaRDI portal
Publication:2029254
DOI10.1016/j.ejor.2019.07.006zbMath1487.90302OpenAlexW2955586674WikidataQ127563575 ScholiaQ127563575MaRDI QIDQ2029254
Manuel Iori, Arthur Kramer, Philippe Lacomme
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11380/1186979
Related Items (3)
Arc-flow approach for single batch-processing machine scheduling ⋮ Tool switching problems with tool order constraints ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications
Cites Work
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- The complexity of scheduling job families about a common due date
- Layered graph approaches for combinatorial optimization problems
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Changeover formulations for discrete-time mixed-integer programming scheduling models
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Batch scheduling to minimize total completion time
- Scheduling with batching: A review
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A survey of scheduling problems with setup times or costs
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Parallel Machine Scheduling by Column Generation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the Complexity of Scheduling with Batch Setup Times
- Solving Parallel Machine Scheduling Problems by Column Generation
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries
- Scheduling parallel machines to minimize weighted flowtime with family set-up times
- Scheduling independent tasks to reduce mean finishing time
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
- Selected Topics in Column Generation
- Dynamic programming algorithms for scheduling parallel machines with family setup times
This page was built for publication: Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
