Abstract
Problem statement: The ratio scheduling algorithm to solve the allocation of jobs in the shop floor was proposed. The problem was to find an optimal schedule so as to minimize the maximum completion time, the sum of distinct earliness and tardiness penalties from a given common due date d. Approach: The objective of the proposed algorithm was to reduce the early penalty and the late penalty and to increase the overall profit of the organization. The proposed method was discussed with different possible instances. Results: The test results showed that the algorithm was robust and simple and can be applied for any job size problem. Conclusion: The proposed algorithm gave encouraging result for the bench mark instances when the due date is less than half of the total processing time.
Highlights
In the Job Shop Scheduling Problem (JSP), a finite set of jobs has to be processed for a specified duration on a single machine around a common due date
Two-stage scheduling problem which minimizes total completion time was discussed by Yang and Lin (2009)
The proposed algorithm is suitable for unrestricted problem against single machine, the algorithm can be extended to m machine scheduling problems
Summary
In the Job Shop Scheduling Problem (JSP), a finite set of jobs has to be processed for a specified duration on a single machine around a common due date. Biskup and Feldmann (2001) created the bench marks for scheduling jobs on a single machine by considering the Common Due Date as decision variable. In this study we discussed about restricted problem with common due date and the early and late penalties being non symmetric and distinct. I.e., the completion time of the last job of E(J) in the optimal schedule coincides with the due date d with nil penalty.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
