Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling

DOI10.1080/00207720500219237zbMath1122.90039OpenAlexW2039773138MaRDI QIDQ5712093

Jen-Shiang Chen, Jason Chao-Hsien Pan

Publication date: 22 December 2005

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207720500219237

zbMATH Keywords

schedulingtardinesstwo-machine flow-shopalternative operations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

On bills of materials structure and optimum product-level smoothing of parts usage in JIT assembly systems ⋮ Computing lower and upper bounds for a large-scale industrial job shop scheduling problem ⋮ Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs

Cites Work

• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
• Job shop scheduling with alternative machines
• Minimizing tardiness in a two-machine flow-shop

This page was built for publication: Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling