Optimal Scheduling for Vector or Scalar Criterion on Parallel Machines with Arbitrary Due Dates of Tasks

2018 ◽  
pp. 39-105 ◽  
Author(s):  
Michael Z. Zgurovsky ◽  
Alexander A. Pavlov
Keyword(s):  
Parallel Machines ◽  
Optimal Scheduling ◽  
Due Dates

Fuzzy Parallel Machines Scheduling Problem Based on Genetic Algorithm

2011 ◽  
Vol 204-210 ◽  
pp. 856-861
Author(s):  
Yuan Xie
Keyword(s):  
Genetic Algorithm ◽  
Parallel Machines ◽  
Optimal Solution ◽  
Scheduling Problem ◽  
Due Dates ◽  
Nsga Ii ◽  
Optimal Solution Set ◽  
Parallel Machines Scheduling ◽  
Nondominated Sorting ◽  
Completion Times

A kind of unrelated parallel machines scheduling problem is discussed. The memberships of fuzzy due dates denote the grades of satisfaction with respect to completion times with jobs. Objectives of scheduling are to maximize the minimum grade of satisfaction while makespan is minimized in the meantime. Two kind of genetic algorithms are employed to search optimal solution set of the problem. Both Niched Pareto Genetic Algorithm (NPGA) and Nondominated Sorting Genetic Algorithm (NSGA-II) can find the Pareto optimal solutions. Numerical simulation illustrates that NSGA-II has better results than NPGA.

Parallel Machine Scheduling with Fuzzy due Date Using Improved Simulated Annealing in Lean Production

2013 ◽  
Vol 457-458 ◽  
pp. 470-473
Author(s):  
Hong Bing Yang ◽  
Fang Yan Mao ◽  
Jun Hao Xu ◽  
Han Xiu Shi
Keyword(s):  
Simulated Annealing ◽  
Parallel Machines ◽  
Lean Production ◽  
Parallel Machine Scheduling ◽  
Mixed Integer ◽  
Scheduling Problems ◽  
Due Dates ◽  
Penalty Cost ◽  
Scheduling Model ◽  
Measure Index

Tardiness scheduling problems in the lean production has received extensive attention recently, and in most tardiness scheduling problems job due dates are regarded as invariable and known in advance. The study deals with fuzzy tardiness scheduling for parallel machines with fuzzy job due dates, where the objective is to minimize the average penalty cost of jobs tardiness. To describe the tardy degree of job clearly, a novel tardiness measure index is introduced based on the possibility and necessity measures in the study. And further, the mixed integer programming scheduling model of parallel machines is constructed for jobs tardiness. Since this problem is NP-hard, an improved simulated annealing is proposed and designed to solve the model. Finally, a numerical experiment is presented to illustrate the feasibility and effectiveness of the proposed method.

Optimal scheduling of batch plants satisfying multiple product orders with different due-dates

2000 ◽  
Vol 24 (9-10) ◽  
pp. 2223-2245 ◽  
Author(s):  
C.A Méndez ◽  
G.P Henning ◽  
J Cerdá
Keyword(s):  
Optimal Scheduling ◽  
Due Dates ◽  
Batch Plants ◽  
Multiple Product
Sign in / Sign up

Export Citation Format

Share Document