Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
From MaRDI portal
Publication:621032
DOI10.1016/j.amc.2010.11.037zbMath1230.90104OpenAlexW1982961869MaRDI QIDQ621032
Publication date: 2 February 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.11.037
branch-and-bound algorithmschedulingflow shopheuristic algorithmtotal weighted completion timesimple linear deterioration
Related Items
Single-machine scheduling with learning and forgetting effects ⋮ Tri-criteria single machine scheduling model with release times and learning factor ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Two-machine flow shop total tardiness scheduling problem with deteriorating jobs ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect ⋮ Single-machine scheduling with time-and-resource-dependent processing times ⋮ Single-machine group scheduling with general deterioration and learning effects ⋮ Single-machine due-window assignment problem with learning effect and deteriorating jobs ⋮ Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning ⋮ Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time ⋮ Single-machine scheduling with accelerating deterioration effects ⋮ Single machine group scheduling with decreasing time-dependent processing times subject to release dates ⋮ 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 ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ Single machine group scheduling with time dependent processing times and ready times ⋮ Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ Single-machine scheduling problems with machine aging effect and an optional maintenance activity ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ The due date assignment scheduling problem with the deteriorating jobs and delivery time
Cites Work
- Unnamed Item
- The complexity of scheduling starting time dependent tasks with release times
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Makespan minimization in machine dominated flowshop
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
- Time-dependent scheduling
- Erratum to: ``A note on flow shop scheduling problems with a learning effect on no-idle dominant machines by M. Cheng et al.
- Scheduling time-dependent jobs under mixed deterioration
- A due-date assignment problem with learning effect and deteriorating jobs
- 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
- Parallel machine scheduling with time dependent processing times
- Single-machine group scheduling problems with deterioration consideration
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time
- 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
- Due-date assignment and parallel-machine scheduling with deteriorating jobs
- Multi-Machine Scheduling With Linear Deterioration
