Solving scheduling problems with earliness and tardiness penalties using priority rules and linear programming
by Samir Saadaoui; Mohamed Mahjoub Dhiaf; Hichem Kamoun; Basem Barqawi
International Journal of Operational Research (IJOR), Vol. 20, No. 4, 2014

Abstract: Most research papers in production scheduling are concerned with the optimisation of a single criterion. However, the study of the performance of schedules often involves more than a single aspect and therefore needs a multi-objective treatment. For example, in just in time philosophy, it is very common to consider two conflicting criteria namely earliness and tardiness. Both of these criteria are obtained from processing times which can be in certain cases fixed or obtained from an interval. This scheduling problem can be solved by a wide range of different approaches including both exact and heuristic methods. In this paper, we try to find the most appropriate method that can minimise the two criteria simultaneously for a practical case in the chemical industry. A zero one integer linear programme was developed and implemented through the software LINDO which allowed us to solve our practical problem and compare its solution to those of some priority rules. The goal of this paper is to develop different methods that can find a schedule which minimises the sum of earliness and tardiness penalties.

Online publication date: Tue, 29-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com