Algorithms for single-machine scheduling problem with deterioration depending on a novel model
DOI10.3934/jimo.2016040zbMath1364.90181OpenAlexW2402477886MaRDI QIDQ2628177
Min Huang, Huaping Wu, Qun-Lin Fan, Wai-Hung Ip
Publication date: 12 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016040
schedulingbranch and boundwaiting timesrelease timesdeterioration modelrules guided nested partitions
Applications of statistics in engineering and industry; control charts (62P30) Management decision making, including multiple objectives (90B50) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Unnamed Item
- The complexity of scheduling starting time dependent tasks with release times
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
- Single-machine scheduling with deteriorating functions for job processing times
- Single-machine scheduling with a nonlinear deterioration function
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem
- Approximate algorithms for unrelated machine scheduling to minimize makespan
- An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
- Single-machine scheduling problems with an actual time-dependent deterioration
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- An Optimization Framework for Product Design
- A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
- An Automatic Method of Solving Discrete Programming Problems
- Scheduling Deteriorating Jobs on a Single Processor
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Nested Partitions Method for Global Optimization
- A tree-search algorithm for mixed integer programming problems
This page was built for publication: Algorithms for single-machine scheduling problem with deterioration depending on a novel model