Purpose: The aims of this article are to develop a new mathematical formulation and a new heuristic for the problem of preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility constraints. Design/methodology: Using the ideas of minimum cost flow network and...

Purpose: The aims of this article are to develop a new mathematical formulation and a new heuristic for the problem of preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility constraints. Design/methodology: Using the ideas of minimum cost flow network and...

Scheduling parallel machines with resource-dependent processing time is common in many operations management, especially in breaking processing bottlenecks in the Theory of Constraint and lean production. This study considers the problem of scheduling a set of jobs on parallel machines when the...