Article Abstract:
Previous research has proposed the adoption of a new scheduling approach that adopts the best from the sequencing and dispatching approaches by switching, depending on the manufacturing status, from fixed sequencing to dispatching. However, in the face of frequent resequencing, the new approach can still be improved by letting it take into account resequencing. The problem of selection between resequencing and switching as a scheduling approach in a job shop setting is studied.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
A cyclic scheduling approach for re-entrant production systems, where the process route of a job passes manufacturing facilities at least once, is described. The proposed scheduling algorithm aims to maximize the production rate and minimize the throughput time. The production rate is maximized by determining the lot size while the throughput time is minimized by implementing a sequencing method of the lots.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
A quick optimal algorithm is proposed for sequentially ordering jobs for processing on a single machine to minimize total tardiness. The model is based on the branch and bound approach applied directly to Lawler's decomposition theorem to yield an optimal solution. Numerical results show that the proposed algorithm is suitable in dynamic scheduling environments where rescheduling is frequently required.
User Contributions:
Comment about this article or add new information about this topic: