A two machine bicriteria scheduling problem

Sarin, Subhash C.; Hariharan, R.

doi:10.1016/s0925-5273(99)00050-x

Cited by 16 publications

(5 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mohri et al (1999) examine the maximum completion time and maximum delay criteria for the three-machine case and Suresh and Chaudhuri (1996) for the m-machine case. Sarin and Hariharan (2000) discuss the problem of minimizing the maximum delay and the number of delayed jobs. The branch-and-bound method is used in their studies.…”

Section: Literature Surveymentioning

confidence: 99%

Bi̇r Üreti̇m Fi̇rmasinda İş Çi̇zelgeleme Problemi̇ İçi̇n Bi̇r Tam Sayili Programlama Modeli̇

2022

View full text Add to dashboard Cite

In this study, a mixed-integer programming model is developed to minimize the total lateness and total completion time of the jobs in an automotive company. In order to respond rapidly to the continuous customer demand through the production, the work schedule of engineers in the research and development department is considered flexibly. Methodology: In the study, the mixed-integer programming model is supported by the analytical hierarchy process model to determine the weighted values of total tardiness and total completion times. The developed model is applied to the automotive company using the real data and the problem is solved using the GAMS CPLEX 24.1.3 software. Findings: In this job scheduling problem, the total completion time is decreased to 622 hours from 10149 hours, maximum tardiness is decreased to 9 hours from 104 hours and total tardiness is decreased to 13 hours from 860 hours by using the proposed model. Originality: The proposed model is used for the job scheduling purpose in compliance with the structure of the automotive industry company using the machine scheduling modeling principles and Analytical Hierarchy Process together.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Bi̇r Üreti̇m Fi̇rmasinda İş Çi̇zelgeleme Problemi̇ İçi̇n Bi̇r Tam Sayili Programlama Modeli̇

2022

View full text Add to dashboard Cite

show abstract

“…Hence due to these reasons work can be completed late and creates due date problem i.e. order can't be delivered on time, on the other hand if the work completes before the due time it arises the inventory problem, [3].…”

Section: Fuzzy Processing Timementioning

confidence: 99%

Fuzzy Scheduling Problem on Two Machines

Kadhum¹,

Aswhad²

2016

IJMTT

View full text Add to dashboard Cite

show abstract

“…If one criterion is dominant, however, the decision maker will prefer to first distinguish the set of all schedules that are optimal with respect to the primary objective and then search within this set of schedules for one that is best for a secondary objective (Pinedo, 2008). This approach is called hierarchical or lexicographic optimization and is an example of a non-scalarizing method (Sarin and Hariharan, 2000;T'kindt et al, 2003).…”

Section: Multicriteria Schedulingmentioning

confidence: 99%

Practical solutions for a dock assignment problem with trailer transportation

Berghman

Leus

2015

European Journal of Operational Research

View full text Add to dashboard Cite

Abstract:We study a distribution warehouse in which trailers need to be assigned to docks for loading or unloading. A parking lot is used as a buffer zone and transportation between the parking lot and the docks is performed by auxiliary resources called terminal tractors. Each incoming trailer has a known arrival time and each outgoing trailer a desired departure time. The primary objective is to produce a docking schedule such that the weighted sum of the number of late outgoing trailers and the tardiness of these trailers is minimized; the secondary objective is to minimize the weighted completion time of all trailers, both incoming and outgoing. The purpose of this paper is to produce high-quality solutions to large instances that are comparable to a real-life case. We implement several heuristic algorithms: truncated branch and bound, beam search and tabu search. Lagrangian relaxation is embedded in the algorithms for constructing an initial solution and for computing lower bounds. The different solution frameworks are compared via extensive computational experiments.

show abstract

A two machine bicriteria scheduling problem

Cited by 16 publications

References 8 publications

Bi̇r Üreti̇m Fi̇rmasinda İş Çi̇zelgeleme Problemi̇ İçi̇n Bi̇r Tam Sayili Programlama Modeli̇

Bi̇r Üreti̇m Fi̇rmasinda İş Çi̇zelgeleme Problemi̇ İçi̇n Bi̇r Tam Sayili Programlama Modeli̇

Fuzzy Scheduling Problem on Two Machines

Practical solutions for a dock assignment problem with trailer transportation

Contact Info

Product

Resources

About