Roshanaei, Vahid

[ 1 ] - No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods

In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...