A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
From MaRDI portal
Publication:6565429
DOI10.1016/J.EJOR.2024.03.011MaRDI QIDQ6565429FDOQ6565429
Kai Li, Jianfu Chen, Chengbin Chu, Abderrahim Sahli
Publication date: 2 July 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
column generationbranch-and-pricetotal weighted completion timeparallel machine schedulingmachine usage costs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex quadratic and semidefinite programming relaxations in scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Task Scheduling in Networks
- Solving Parallel Machine Scheduling Problems by Column Generation
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- An integrated approach for scheduling health care activities in a hospital
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Two parallel machine sequencing problems involving controllable job processing times
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Scheduling Unrelated Machines by Randomized Rounding
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
- Energy efficient scheduling of open-pit coal mine trucks
- Uniform parallel machine scheduling with resource consumption constraint
- Parallel Machine Scheduling: Impact of Adding Extra Machines
- Uniform parallel machine scheduling problems with fixed machine cost
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
- Ideal schedules in parallel machine settings
- Single-machine scheduling with an external resource
- Production, maintenance and resource scheduling: a review
This page was built for publication: A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565429)