A new mathematical model for hybrid flow shop under time-varying resource and exact time-lag constraints

DOI10.1007/978-3-030-92666-3_8MaRDI QIDQ6629023

Nhan Quy Nguyen, Hicham Chehade, Quoc Nhat Han Tran, Frédéric Dugardin, Farouk Yalaoui

Publication date: 29 October 2024

zbMATH Keywords

optimizationproject schedulinghybrid flow shopMILP

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Event-based MILP models for resource-constrained project scheduling problems
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Insertion techniques for static and dynamic resource-constrained project scheduling.
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
• On the strength of time-indexed formulations for the resource-constrained project scheduling problem
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Scheduling coupled tasks with exact delays for minimum total job completion time
• An updated survey of variants and extensions of the resource-constrained project scheduling problem
• A Horizon-Varying, Zero-One Approach to Project Scheduling
• Improved Compact Models for the Resource-Constrained Project Scheduling Problem
• Resource-constrained Project Scheduling — The State of the Art

This page was built for publication: A new mathematical model for hybrid flow shop under time-varying resource and exact time-lag constraints