|
Scheduling is the resource distribution of policy-making problems, which significantly influence the capacity of dealing with contingency events and the competitive ability of a job shop flow control. A plenty patterns of scheduling problems have been developed in literature. Among of them, the drum-buffer-rope (DBR) procedures have been implemented in many different fields and achieved remarkable improvement in practical factories. However, most used DBR studies considered and implemented this method in a flowshop with single machine at each process. Once DBR is used to the parallel machines of a workstation environment, the definition of capacity constrained resources (CCR) and the scheduling of CCR become more complexity than single machine one. In this paper, we propose an allocation approach (CL′) to schedule the workloads of CCR, and then apply three different rules to rearrange the ruined jobs in CCR to minimize the makespan of all jobs. The developed DBR approach is illustrated by one example. Five randomly generated examples are used to demonstrate its effectiveness in solution quality. The experiment results reveal that the developed CL′ approach is sound in the objective of makespan.
|