Complexity analysis of job-shop scheduling with deteriorating jobs
From MaRDI portal
Publication:1348391
DOI10.1016/S0166-218X(00)00385-1zbMath1004.68031OpenAlexW2053443627MaRDI QIDQ1348391
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00385-1
Related Items
Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Minimizing total completion time in a two-machine flow shop with deteriorating jobs ⋮ Flow shop scheduling problems with decreasing linear deterioration under dominant machines ⋮ Single machine quadratic penalty function scheduling with deteriorating jobs and group technology ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints ⋮ A note on the complexity of flow-shop scheduling with deteriorating jobs ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Total completion time in a two-machine flowshop with deteriorating tasks ⋮ Single machine group scheduling under decreasing linear deterioration ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Flow shop scheduling with effects of learning and deterioration ⋮ Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint ⋮ A scheduling problem with job values given as a power function of their completion times ⋮ Minimizing makespan in a two-machine flow shop with effects of deterioration and learning ⋮ Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning ⋮ Single machine scheduling problems with deteriorating jobs ⋮ A note on scheduling problems with learning effect and deteriorating jobs ⋮ The Browne-Yechiali single-machine sequence is optimal for flow-shops ⋮ Scheduling in a contaminated area: a model and polynomial algorithms ⋮ Preemptive scheduling with simple linear deterioration on a single machine ⋮ Single machine scheduling with decreasing linear deterioration under precedence constraints ⋮ A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem ⋮ ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation ⋮ Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates ⋮ A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs ⋮ Isomorphic scheduling problems ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Scheduling deteriorating jobs with rejection on dominant machines ⋮ SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE ⋮ A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs ⋮ SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
Cites Work
- Unnamed Item
- Scheduling jobs under simple linear deterioration
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Parallel machine scheduling with time dependent processing times
- Optimal two- and three-stage production schedules with setup times included
- Scheduling Deteriorating Jobs on a Single Processor
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Open Shop Scheduling to Minimize Finish Time
- The Complexity of Flowshop and Jobshop Scheduling
- Computational Complexity of Discrete Optimization Problems
- Scheduling deteriorating jobs to minimize makespan
- Multi-Machine Scheduling With Linear Deterioration
- The NP-completeness column: An ongoing guide
