A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
DOI10.1016/j.ejor.2018.05.050zbMath1403.90375OpenAlexW2804041392WikidataQ129769307 ScholiaQ129769307MaRDI QIDQ1653363
Roberto Baldacci, Ting Wang, Qian Hu, Andrew E. B. Lim
Publication date: 3 August 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.050
schedulingsingle machine schedulingbranch-and-pricedeterioration effectflexible periodic maintenance
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Cites Work
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- Branching in branch-and-price: A generic scheme
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Single-machine scheduling with periodic maintenance to minimize makespan
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Scheduling jobs under simple linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Machine scheduling with a rate-modifying activity
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- An optimal single-machine scheduling with linear deterioration rate and rate-modifying activities
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Parallel Machine Scheduling by Column Generation
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Decomposition Principle for Linear Programs
- Scheduling Deteriorating Jobs on a Single Processor
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- Solving Parallel Machine Scheduling Problems by Column Generation
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Scheduling jobs with position-dependent processing times
- Column Generation
- A Primer in Column Generation
- Shortest Path Problems with Resource Constraints
This page was built for publication: A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine