Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
From MaRDI portal
Publication:2140270
DOI10.1016/j.ejor.2021.11.023zbMath1506.90116OpenAlexW3213690588MaRDI QIDQ2140270
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.023
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The third comprehensive survey on scheduling problems with setup times/costs
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- A state-of-the-art review of parallel-machine scheduling research
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm
- A survey of adjustable robust optimization
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Bi-objective parallel machine scheduling with additional resources during setups
- Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
- Robust scheduling with budgeted uncertainty
- A survey of scheduling problems with setup times or costs
- Multicriteria scheduling
- Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Heuristics, metaheuristics and approximate methods in planning and scheduling
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
- A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
- Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs
- A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
- Parallel Machine Scheduling under Uncertainty
- Minimizing Total Tardiness on One Machine is NP-Hard
- Decomposition Principle for Linear Programs
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Solving Parallel Machine Scheduling Problems by Column Generation
- Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times
- Scheduling
This page was built for publication: Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
