.png){kind=icon}
Return
An uncertain multi-objective programming model for machine scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-016-0522-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper discusses a parallel machine scheduling problem in which the processing times of jobs and the release dates are independent uncertain variables with known uncertainty distributions. An uncertain programming model with multiple objectives is obtained, whose first objective is to minimize the maximum completion time or makespan, and second objective is to minimize the maximum tardiness time. A genetic algorithm is employed to solve the proposed uncertain machine scheduling model, and its efficiency is illustrated by some numerical experiments.
Keywords:
Machine scheduling problem
Uncertain variable
Uncertain programming
Genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
3.2K
Citations:
5.6K
Organization
Cited Papers
ShareSaveShareSaveWheat Bread Fortification by Grape Pomace Powder: Nutritional, Technological, Antioxidant, and Sensory Properties.png)
Foods
OAAI
FoodsIF0
OAAIShareSaveMolecular systematics and morphological identification of the cryptic species of the genus Acalles Schoenherr, 1825, with descriptions of new species (Coleoptera: Curculionidae: Cryptorhynchinae)Zootaxa
ZootaxaIF0
PREAI
ShareSaveGroup shops scheduling with makespan criterion subject to random release dates and processing times
PREAI
ShareSaveShareSave
View more