No-wait or no-idle permutation flowshop scheduling with dominating machines
type: Item
instance of: scholarly article
title: No-wait or no-idle permutation flowshop scheduling with dominating machines
zbMATH Open document ID: 1138.90400
DOI: 10.1007/BF02936066
author: Ji-Bo Wang
author: Zun-Quan Xia
published in: Journal of Applied Mathematics and Computing
publication date: 2005-03-10T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2143273
MaRDI profile type: Publication
cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
cites work: Nonpreemptive flowshop scheduling with machine dominance
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Flowshop scheduling with dominant machines
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Q4124328
cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Flow-shops with a dominant machine
cites work: Some new results in flow shop scheduling
cites work: The Three-Machine No-Wait Flow Shop is NP-Complete
Recommended article: No-wait flexible flowshop scheduling with no-idle machines
Recommended article: Permutation, no-wait, no-idle flow shop problems
Recommended article: Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
Recommended article: Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
Recommended article: Nonpreemptive flowshop scheduling with machine dominance
Recommended article: A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
Recommended article: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
Recommended article: Performance of scheduling algorithms for no-wait flowshops with parallel machines
Recommended article: No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
Recommended article: Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
description: scientific article; zbMATH DE number 2143273