Abstract We consider the problem of scheduling jobs with equal lengths and arbitrary sizes on uniform parallel batch machines different capacities. Each machine can only process whose are not larger than its capacity. Several be processed as a simultaneously machine, long their total size does exceed machine’s The objective is to minimize makespan. Under divisibility constraint, we obtain two e...

In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...

—A natural approach for scheduling tasks to a workstation cluster is to employ the multiple machines in the cluster to schedule the task graphs so that the cluster manifests itself as a “self-scheduled” platform. A few parallel approaches have been devised for scheduling task graphs using a parallel machine such as an Intel Paragon but they are not suitable for a cluster of workstations environ...