A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
type: Item
instance of: scholarly article
title: A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
zbMATH Open document ID: 1392.90068
author: Yi Tan
author: Lars Mönch
author: John Fowler
published in: Journal of Scheduling
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6859796
zbMATH Keywords: two-stage flexible flow shop
zbMATH Keywords: batching
zbMATH Keywords: decomposition
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: computational experiments
MaRDI profile type: Publication
full work available at URL: s10951-017-0530-4
OpenAlex ID: W2626058839
cites work: Scheduling hybrid flowshop with parallel batching machines and compatibilities
cites work: Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
cites work: A computational study of shifting bottleneck procedures for shop scheduling problems
cites work: Decomposition methods for reentrant flow shops with sequence-dependent setup times
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Variable neighborhood search: Principles and applications
cites work: A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem
cites work: Bottleneck-focused scheduling for a hybrid flowshop
cites work: Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
cites work: Improved MILP models for two-machine flowshop with batch processing machines
cites work: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
cites work: Applying machine based decomposition in 2-machine flow shops
cites work: The use of upstream and downstream information in scheduling semiconductor batch operations
cites work: The hybrid flow shop scheduling problem
cites work: An iterative approach for the serial batching problem with parallel machines and job families
cites work: A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
cites work: Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
cites work: Minimizing due date related performance measures on two batch processing machines
cites work: A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
cites work: Heuristics for minimizing total weighted tardiness in flexible flow shops
DOI: 10.1007/S10951-017-0530-4
description: scientific article; zbMATH DE number 6859796