Single crane scheduling problems

Conference · Sat Dec 31 04:00:00 EST 1994

OSTI ID:36405

Posner, M; Park, K S

We consider scheduling problems where a crane transports jobs between machines, and between storage locations and machines. We first construct a taxonomy for crane scheduling problems. Then we determine the computational complexity of problems with one crane and infinite buffers, where the objective is to minimize the makespan. Given a set of different jobs, when there is one station for job processing and a station for the storage of either raw material or finished goods, the problem can be solved in polynomial time. More complicated problems are shown to be NP-complete. These include the problem where there is one station for job processing, one for raw material and one for finished goods. For this problem, we also find two special cases when the problem can be solved in polynomial time. When there are two processing stations, the problem is also NP-complete. This is the classical two machine flow shop problem with the complication that a transporter moves jobs between the two machines.

• OSTI ID: 36405
• Report Number(s): CONF-9408161--
• Country of Publication: United States
• Language: English

Related Subjects

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION
99 GENERAL AND MISCELLANEOUS
COMPUTERIZED SIMULATION
CRANES
OPTIMIZATION
SCHEDULES