Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan

DOI10.1016/j.ejor.2010.11.021zbMath1213.90121OpenAlexW2003007295MaRDI QIDQ541691

Yong-Cai Geng, Sumit K. Garg

Publication date: 7 June 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.11.021

zbMATH Keywords

schedulingdynamic programmingbatchingrelease datesdeterioration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (27)

Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan ⋮ A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine ⋮ Batch scheduling with deteriorating jobs to minimize the total completion time ⋮ Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration ⋮ Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time ⋮ Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine ⋮ Parallel-batch scheduling with deterioration and rejection on a single machine ⋮ A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing ⋮ Parallel-batch scheduling with two models of deterioration to minimize the makespan ⋮ A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities ⋮ Online scheduling with linear deteriorating jobs to minimize the total weighted completion time ⋮ Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine ⋮ Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times ⋮ A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan ⋮ Scheduling of deteriorating jobs with release dates to minimize the maximum lateness ⋮ Single machine serial-batching scheduling with independent setup time and deteriorating job processing times ⋮ Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ Complexity of scheduling with proportional deterioration and release dates ⋮ Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity ⋮ A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS ⋮ SCHEDULING POSITION-BASED DETERIORATING JOBS WITH MULTIPLE RATE-MODIFYING ACTIVITIES AND PAST-SEQUENCE-DEPENDENT DELIVERY TIMES

Cites Work

• Unnamed Item
• Parallel-machine scheduling of simple linear deteriorating jobs
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Time-dependent scheduling
• Scheduling linear deteriorating jobs with rejection on a single machine
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• Single machine parallel-batch scheduling with deteriorating jobs
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
• Equivalent time-dependent scheduling problems
• Resource level minimization in the discrete-continuous scheduling
• Scheduling a batching machine
• Scheduling jobs under simple linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Approximation algorithms in batch processing
• Scheduling one batch processor subject to job release dates
• Minimizing makespan with release times on identical parallel batching machines
• Single machine earliness-tardiness scheduling with resource-dependent release dates
• Minimizing makespan in batch machine scheduling
• Parallel machine scheduling with time dependent processing times
• Scheduling with batching: A review
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Scheduling with time dependent processing times: Review and extensions
• Parametric problem in scheduling theory
• Algorithms for Scheduling Independent Tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Scheduling Groups of Jobs on a Single Machine
• Multi-Machine Scheduling With Linear Deterioration
• Minimizing maximum lateness under linear deterioration

This page was built for publication: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan