Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Software Technology and Engineering, 3rd (ICSTE 2011)
Mohamed Othman
Mohamed Othman
Search for other works by this author on:
Raja Suzana Raja Kasim
Raja Suzana Raja Kasim
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

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.

Key Words
1 Introduction
2. Problem Statement and Terminology
3 Propositions and Algorithm
4. Conclusion
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal