Total tardiness minimization in permutation flowshop with deterioration consideration
From MaRDI portal
Publication:1630777
DOI10.1016/j.apm.2013.11.031zbMath1427.90148OpenAlexW1968863410MaRDI QIDQ1630777
Wen-Chiung Lee, Yu-Hsiang Chung, Yeh, Wei-Chang
Publication date: 10 December 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.11.031
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 general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance, Shop scheduling in manufacturing environments: a review, Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop, Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs, Single-machine scheduling problems with machine aging effect and an optional maintenance activity
Cites Work
- Optimization by Simulated Annealing
- Single-machine scheduling with precedence constraints and position-dependent processing times
- Single-machine group scheduling with general deterioration and learning effects
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
- Single-machine scheduling with deteriorating functions for job processing times
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
- A two-machine flowshop problem with two agents
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- Time-dependent scheduling
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Minimizing total tardiness in permutation flowshops
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A concise survey of scheduling with time-dependent processing times
- A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Single-machine scheduling with time-and-resource-dependent processing times
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
- Scheduling with time dependent processing times: Review and extensions
