Group-shop scheduling with sequence-dependent set-up and transportation times

DOI10.1016/j.apm.2014.03.035zbMath1428.90066OpenAlexW2005073673MaRDI QIDQ1634110

Fardin Ahmadizar, Parmis Shahmaleki

Publication date: 17 December 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2014.03.035

zbMATH Keywords

makespangenetic algorithmgroup-shop schedulingsequence-dependent set-up timestransportation times

Mathematics Subject Classification ID

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

Related Items (5)

A two-stage flow shop scheduling problem with transportation considerations ⋮ New complexity results on scheduling problem in a robotic cell ⋮ An integrated producer-buyer supply chain with delivery cost under stochastic transportation time ⋮ Two-stage assembly scheduling problem for minimizing total tardiness with setup times ⋮ Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops

Cites Work

• Hybrid flowshop scheduling with machine and resource-dependent processing times
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
• An ant colony optimization algorithm for shop scheduling problems
• Tabu search algorithms for job-shop problems with a single transport robot
• The flexible blocking job shop with transfer and set-up times
• Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems
• Group shops scheduling with makespan criterion subject to random release dates and processing times
• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• A new neighborhood and tabu search for the blocking job shop
• An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
• A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• The significance of reducing setup times/setup costs
• A survey of scheduling problems with setup times or costs
• A fast tabu search algorithm for the group shop scheduling problem
• Principles of Sequencing and Scheduling
• Introduction to Genetic Algorithms
• Scheduling
• Introduction to evolutionary computing

This page was built for publication: Group-shop scheduling with sequence-dependent set-up and transportation times