Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
From MaRDI portal
Publication:2140270
Recommendations
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- A robust optimization approach for the unrelated parallel machine scheduling problem
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
Cites work
- 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
- A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times
- A PTAS for minimizing the total weighted completion time on identical parallel machines.
- A state-of-the-art review of parallel-machine scheduling research
- A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
- A survey of adjustable robust optimization
- A survey of scheduling problems with setup times or costs
- An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
- 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
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Decomposition Principle for Linear Programs
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Heuristics, metaheuristics and approximate methods in planning and scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- Multicriteria scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling under uncertainty
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Robust optimization
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- Robust scheduling with budgeted uncertainty
- Scheduling algorithms
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- Scheduling. Theory, algorithms, and systems
- Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
- Solving Parallel Machine Scheduling Problems by Column Generation
- Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
- The third comprehensive survey on scheduling problems with setup times/costs
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- 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
Cited in
(20)- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- 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
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production
- A robust optimization approach for the unrelated parallel machine scheduling problem
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date
- Scheduling identical serial-batching machines in the engine manufacturing supply chain by an integrated variable neighborhood search Algorithm
- A distributionally robust approach for the parallel machine scheduling problem with optional machines and job tardiness
- A weighted distribution-free model for parallel machine scheduling with uncertain job processing times
- Bilinear branch and check for unspecified parallel machine scheduling with shift consideration
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- Feature-driven robust stochastic scheduling for printed circuit board assembly
- Improved algorithms for the two-machine flow shop scheduling problem with uncertain setup times to minimize total tardiness
- The fourth comprehensive review of scheduling problems with setup times
- Adaptive optimization approach for production and distribution planning of perishable food products under demand uncertainty
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
This page was built for publication: Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140270)
