Machine Scheduling Problem Under Uncertain Environment

Uncertain programming has been applied to many classic optimization problems since it was founded in 2009. The machine scheduling problem plays an important role in shop management, computer systems, automatic manufacturing and so on. The uncertain variables were introduced to the research of machine scheduling problems in 2010.After that many researchers studied the machine scheduling problem under the uncertain environment. The main results are the minimized makespan model, the expected-varianceentropy model and the goal programming model of machine scheduling problem. However, the previous study didn’t involve the release time or the due time of jobs.In practical production, the jobs are often delivered to the factory in batches, so we need to consider the release time. The due time is also very common in many cases. This paper will introduce release time and due time to the machine scheduling problem under uncertain environment and discuss the completion time of jobs and the makespan. The main contributions are as follows.1. Introduce release time r to machine scheduling problems under the uncertain environment and put up a new minimized makespan model of the parallel machine scheduling problem;2. Introduce due time d to machine scheduling problems under the uncertain environment and put up two new machine scheduling models: weighted tardiness minimized model and weighted earliness minimized model;3. Design a hybrid intelligent algorithm for the new models and give some numerical examples.