Showing 1 - 8 of 8
In the process industries, specialized equipment and production processes often necessitate the manufacture of products in a pre-determined sequence to minimize changeover time and to simplify scheduling complexity; these types of schedules are referred to as pure rotation schedules, or product...
Persistent link: https://www.econbiz.de/10010906461
This paper deals with the robust optimization for the cyclic hoist scheduling problem with processing time window constraints. The robustness of a cyclic hoist schedule is defined as its ability to remain stable in the presence of perturbations or variations of certain degree in the hoist...
Persistent link: https://www.econbiz.de/10010939793
This paper addresses a crane scheduling and machine layout problem in a Computer Integrated Manufacturing (CIM) Environment. A single crame is used to move all the Work-in-Process (WIP) in the system. The overall system objective is to maximize the yield rate subject to the flow time limit of...
Persistent link: https://www.econbiz.de/10009204066
This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types in which the processing times of parts can vary within their given time windows. The problem consists of two types of sequencing issues: part input sequencing and robot move...
Persistent link: https://www.econbiz.de/10010760060
A method for solving the scheduling problem for a class of cyclic systems with respect to throughput maximization is presented. A strictly cyclic mode of operation is considered, where the time offset between the start of consecutive jobs is always constant. All jobs have to follow an identical...
Persistent link: https://www.econbiz.de/10010748568
The problem of cyclic scheduling of two hoists is defined as follows. There are N + 1 workstations, S<sub>0</sub>, S<sub>1</sub>, ..., S<sub>N</sub>, and two identical hoists that move jobs between stations. Jobs are identical and each job has to visit all stations in the order that stations are numbered. It is assumed that the...
Persistent link: https://www.econbiz.de/10009191442
In this paper we study the Common Cycle Scheduling Problem (CCSP). This classic production problem is concerned with determining optimal production lot sizes for a given set of products using a common facility. CCSP is based on scheduling all products using a common (base) cycle time, so that...
Persistent link: https://www.econbiz.de/10009197642
Firms that build flexibility into their manufacturing system gain a competitive edge from their ability to efficiently produce a mid-variety of products at mid-volumes. In order to realize the competitive edge of flexible systems, manufacturing management has to deal effectively with the greater...
Persistent link: https://www.econbiz.de/10009197879