Minimizing total completion time in a two-machine flow shop with deteriorating jobs

DOI10.1016/j.amc.2005.11.162zbMath1104.90023OpenAlexW2084374562MaRDI QIDQ850246

Li-Li Liu, C. T. Daniel Ng, Ji-Bo Wang, Cheng, T. C. Edwin

Publication date: 15 November 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.162

zbMATH Keywords

schedulingtotal completion timesimple linear deteriorationflow-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Permutation flowshop scheduling with simple linear deterioration ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ SINGLE-MACHINE SCHEDULING WITH PROPORTIONALLY DETERIORATING JOBS SUBJECT TO AVAILABILITY CONSTRAINTS ⋮ A multi-objective particle swarm for a flow shop scheduling problem ⋮ Single-machine scheduling with logarithm deterioration ⋮ Two-machine flow shop total tardiness scheduling problem with deteriorating jobs ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties ⋮ Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs ⋮ Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ Some single-machine and flowshop scheduling problems with a non-linear deterioration function ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ A single-machine scheduling with a truncated linear deterioration and ready times ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ Single-machine scheduling with nonlinear deterioration ⋮ A note on single-machine scheduling with decreasing time-dependent job processing times ⋮ No-wait flow shop scheduling using fuzzy multi-objective linear programming ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem ⋮ 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 ⋮ Single machine parallel-batch scheduling with deteriorating jobs ⋮ Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS

Cites Work

• Unnamed Item
• The complexity of scheduling starting time dependent tasks with release times
• Scheduling jobs under decreasing linear deterioration
• The two-machine total completion time flow shop problem
• Scheduling jobs under simple linear deterioration
• Complexity of scheduling tasks with time-dependent execution times
• Single machine scheduling with start time dependent processing times: Some solvable cases
• Flowshop scheduling with dominant machines
• Complexity analysis of job-shop scheduling with deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• Parallel machine scheduling with time dependent processing times
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• V-Shaped Policies for Scheduling Deteriorating Jobs
• The Complexity of Flowshop and Jobshop Scheduling
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Multi-Machine Scheduling With Linear Deterioration