Open Access System for Information Sharing

Login Library

 

Article
Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Ideal schedules in parallel machine settings

Title
Ideal schedules in parallel machine settings
Authors
Jiang, X.Lee, K.Pinedo, M.L.
Date Issued
16-Apr-2021
Publisher
ELSEVIER
Abstract
An ideal schedule is a schedule that simultaneously minimizes the two most popular scheduling objectives, namely the makespan and the total completion time. If a scheduling problem always has an ideal schedule, then the problem is called an ideal problem. We summarize ideal problem results of various scheduling problems in different machine environments and with job characteristics that include precedence constraints, release dates, processing times, eligibility constraints and preemptions. We present a comprehensive overview of ideal schedules including our new findings. (C) 2020 Elsevier B.V. All rights reserved.
Keywords
MEAN FLOW TIME; ARBITRARY RELEASE TIMES; EQUAL LENGTH JOBS; PRECEDENCE CONSTRAINTS; TASKS; COMPLEXITY; ALGORITHM
URI
http://oasis.postech.ac.kr/handle/2014.oak/104866
ISSN
0377-2217
Article Type
Article
Citation
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 290, no. 2, page. 422 - 434, 2021-04-16
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

이강복LEE, KANGBOK
Dept of Industrial & Management Enginrg
Read more

Views & Downloads

Browse