A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs

DOI10.1016/J.EJOR.2024.03.011MaRDI QIDQ6565429zbMATH OpenFDO

Authors Jianfu Chen, Chengbin Chu, Abderrahim Sahli, Kai Li

Publication date 2 July 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

column generationbranch-and-pricetotal weighted completion timeparallel machine schedulingmachine usage costs

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 1305540 (Why is no real title available?)
• scientific article; zbMATH DE number 1405788 (Why is no real title available?)
• A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
• A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
• 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
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem
• An integrated approach for scheduling health care activities in a hospital
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
• Convex quadratic and semidefinite programming relaxations in scheduling
• Energy efficient scheduling of open-pit coal mine trucks
• Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
• Ideal schedules in parallel machine settings
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel Machine Scheduling: Impact of Adding Extra Machines
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Production, maintenance and resource scheduling: a review
• Scheduling Unrelated Machines by Randomized Rounding
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
• Single-machine scheduling with an external resource
• Solving Parallel Machine Scheduling Problems by Column Generation
• Task Scheduling in Networks
• Two parallel machine sequencing problems involving controllable job processing times
• Uniform parallel machine scheduling problems with fixed machine cost
• Uniform parallel machine scheduling with resource consumption constraint

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)