Research Article

Simulation Optimization for the Multihoist Scheduling Problem

Table 1

An MHSP example.

Operations job, precedenceProcessing time window (min) machines

20–3020–4010–3010–50
30–4010–4020–30
30–40
20–3010–3010–30
30–5050–6010–20
10–20
10–2010–3020–30
10–20
20–3020–30
Tracks1
Hoists1
Transfer time1 (between locations)
Cross time1 (for any machine)