Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines

DOI10.1007/S11590-018-1322-2MaRDI QIDQ828672zbMATH OpenOpenAlexWikidataFDO

Authors Shaojun Lu, Jun Pei, Panos M. Pardalos, Xinbao Liu

Publication date 5 May 2021

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-018-1322-2

zbMATH Keywords

schedulingdeteriorating jobsflowshopsequence dependent setup timesdominant machinespart family

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
• Minimizing makespan in permutation flow shop scheduling with proportional deterioration
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Flow shop scheduling problems with time-dependent processing times on dominated machines

Cites work

• A concise survey of scheduling with time-dependent processing times
• A fast tabu search algorithm for the permutation flow-shop problem
• Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
• Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
• Flow shop scheduling with effects of learning and deterioration
• Flowshop scheduling with dominant machines
• Minimizing makespan in three-machine flow shops with deteriorating jobs
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
• Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
• Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
• Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
• Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
• Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
• Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
• Single-machine scheduling problems with past-sequence-dependent setup times
• Solution algorithms for synchronous flow shop problems with two dominating machines
• Two‐machine flowshop scheduling with conditional deteriorating second operations

Cited in

(6)

• Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
• An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
• Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
• Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates

This page was built for publication: Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828672)