Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations
Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations
About this item
Full title
Author / Creator
Publisher
Basel: MDPI AG
Journal title
Language
English
Formats
Publication information
Publisher
Basel: MDPI AG
Subjects
More information
Scope and Contents
Contents
We study two-machine shop-scheduling problems provided that lower and upper bounds on durations of n jobs are given before scheduling. An exact value of the job duration remains unknown until completing the job. The objective is to minimize the makespan (schedule length). We address the issue of how to best execute a schedule if the job duration ma...
Alternative Titles
Full title
Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2545911898
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2545911898
Other Identifiers
ISSN
1999-4893
E-ISSN
1999-4893
DOI
10.3390/a13010004
