Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

General Optimization Methods Mathematical Programming, Constraint Programming, Heuristics Problem Specific Algorithms (Dynamic Programming, Branch and Bound) Scheduling Single and Parallel Machine Models Flow Shops and Flexible Flow Shops Job Shops Resource-Constrained Project Scheduling Timetabling Interval Scheduling, Reservations Educational Timetabling Workforce and Employee Timetabling Tra...