Two-stage hybrid flow shop scheduling with dynamic job arrivals
type: Item
instance of: scholarly article
title: Two-stage hybrid flow shop scheduling with dynamic job arrivals
zbMATH Open document ID: 1251.90203
author: Frank S. Yao
author: Mei Zhao
author: Hui Zhang
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6107600
zbMATH Keywords: batch scheduling
zbMATH Keywords: dynamic programming
zbMATH Keywords: heuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2011.10.006
OpenAlex ID: W1996628037
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
cites work: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
cites work: The hybrid flow shop scheduling problem
cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals
cites work: The use of upstream and downstream information in scheduling semiconductor batch operations
cites work: Scheduling batch processing machines with incompatible job families
cites work: A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
cites work: Q4949162
cites work: A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
cites work: Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
cites work: A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
cites work: Makespan minimization in a no-wait flow shop problem with two batching machines
cites work: Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
cites work: Scheduling Groups of Jobs on a Single Machine
DOI: 10.1016/J.COR.2011.10.006
Recommended article: A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
Recommended article: Two-Stage, Hybrid Flowshop Scheduling Problem
Recommended article: Two-stage hybrid flowshop scheduling with simultaneous processing machines
Recommended article: Scheduling two-stage hybrid flow shop with availability constraints
Recommended article: Optimal scheduling of a two-stage hybrid flow shop
Recommended article: Scheduling two-stage jobs on multiple flowshops
Recommended article: Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
Recommended article: A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
Recommended article: On scheduling multiple two-stage flowshops
Recommended article: Minimizing tardy jobs in a two-stage hybrid flowshop
description: scientific article; zbMATH DE number 6107600