An Algorithm for Determining the Optimal Waiting Times in Machine Scheduling Problem


In this paper, we consider the problem of determining the optimal real waiting times in single machine with a set of given operation sequences and dependent time windows. This problem typically arises in the manufacturing environment where next operation has to be carried out within a time interval after the completion of its immediate predecessors. The objective is to minimize the makespan. In this paper, we introduce a polynomial time algorithm that solves this problem in O(n2), where n stands for the total number of operations in a schedule.

  • Abstract
  • Key Words
  • 1 Introduction
  • 2. Problem Statement and Terminology
  • 3 Propositions and Algorithm
  • 4. Conclusion
  • Acknowledgment
  • References

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In