Flow shop non-idle scheduling and resource-constrained scheduling

DOI10.1007/s10479-015-2070-7zbMath1334.90055OpenAlexW2283981505MaRDI QIDQ271983

Yen-Shing Tsai, Bertrand M. T. Lin

Publication date: 20 April 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-2070-7

zbMATH Keywords

dynamic programmingperformance analysisflow shopfinancial planningresource constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• Johnson's rule, composite jobs and the relocation problem
• A fast feasibility test for relocation problems
• The two-machine total completion time flow shop problem
• Polynomial algorithms for single machine scheduling problems with financial constraints
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• The Complexity of Flowshop and Jobshop Scheduling
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP

This page was built for publication: Flow shop non-idle scheduling and resource-constrained scheduling