![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Abstract
For two-operation crane scheduling problems we consider two basic procedures; namely, batching and meshing. A minimum-ordered partition forms the basis of the batching procedure. A mesh-ordered relation forms the basis of the meshing procedure. Under certain necessary conditions, these procedures yield optimal schedules. Examples are provided to illustrate each procedure. Four mixed procedures are defined and combined to form an efficient algorithm whose solution is no worse than 4/3 the optimal solution.
