Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
From MaRDI portal
Publication:1001006
DOI10.1016/j.cor.2008.07.008zbMath1179.90142OpenAlexW2093278060MaRDI QIDQ1001006
Publication date: 12 February 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.07.008
Related Items (26)
Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines ⋮ Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Scheduling deteriorating jobs with a learning effect on unrelated parallel machines ⋮ A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology ⋮ Single-machine scheduling with precedence constraints and position-dependent processing times ⋮ Single-machine scheduling problems with an actual time-dependent deterioration ⋮ Single-machine scheduling problems with both deteriorating jobs and learning effects ⋮ Single-machine scheduling with time-and-resource-dependent processing times ⋮ 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 ⋮ Single-machine group scheduling with deteriorating jobs and allotted resource ⋮ Single machine group scheduling with decreasing time-dependent processing times subject to release dates ⋮ A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem ⋮ Single-machine scheduling with nonlinear deterioration ⋮ Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties ⋮ Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness ⋮ Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ Single machine scheduling with sum-of-logarithm-processing-times based deterioration ⋮ Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times ⋮ Single machine group scheduling with time dependent processing times and ready times ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times ⋮ Single-machine scheduling problems with precedence constraints and simple linear deterioration ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Complexity analysis of job-shop scheduling with deteriorating jobs
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A concise survey of scheduling with time-dependent processing times
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Heuristic algorithms for continuous flow-shop problem
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
