Group-shop scheduling with sequence-dependent set-up and transportation times
type: Item
instance of: scholarly article
title: Group-shop scheduling with sequence-dependent set-up and transportation times
zbMATH Open document ID: 1428.90066
author: Fardin Ahmadizar
author: Parmis Shahmaleki
published in: Applied Mathematical Modelling
publication date: 2018-12-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6994320
zbMATH Keywords: group-shop scheduling
zbMATH Keywords: sequence-dependent set-up times
zbMATH Keywords: transportation times
zbMATH Keywords: makespan
zbMATH Keywords: genetic algorithm
MaRDI profile type: Publication
full work available at URL: j.apm.2014.03.035
OpenAlex ID: W2005073673
cites work: The significance of reducing setup times/setup costs
cites work: A survey of scheduling problems with setup times or costs
cites work: Scheduling
cites work: Principles of Sequencing and Scheduling
cites work: An ant colony optimization algorithm for shop scheduling problems
cites work: A fast tabu search algorithm for the group shop scheduling problem
cites work: Group shops scheduling with makespan criterion subject to random release dates and processing times
cites work: A new neighborhood and tabu search for the blocking job shop
cites work: The flexible blocking job shop with transfer and set-up times
cites work: Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
cites work: A branch and bound method for the job-shop problem with sequence-dependent setup times
cites work: A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
cites work: Tabu search algorithms for job-shop problems with a single transport robot
cites work: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
cites work: Hybrid flowshop scheduling with machine and resource-dependent processing times
cites work: A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
cites work: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
cites work: Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems
cites work: Introduction to evolutionary computing
cites work: Introduction to Genetic Algorithms
DOI: 10.1016/J.APM.2014.03.035
description: scientific article; zbMATH DE number 6994320