Integer Programming Formulations in Sequencing with Total Earliness and Tardiness Penalties, Arbitrary Due Dates, and No Idle Time: A Concise Review and Extension

Omega ◽  
2021 ◽  
pp. 102446
Author(s):  
Bahram Alidaee ◽  
Haitao Li ◽  
Haibo Wang ◽  
Keith Womer
Keyword(s):  
Integer Programming ◽  
Idle Time ◽  
Due Dates ◽  
Earliness And Tardiness ◽  
Concise Review

Application of Mixed-Integer Programming and Dispatching Rules on Parallel Machine Scheduling with Inserted Idle Time

2013 ◽  
Vol 437 ◽  
pp. 748-751
Author(s):  
Chi Yang Tsai ◽  
Yi Chen Wang
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Parallel Machines ◽  
Optimal Solution ◽  
Parallel Machine Scheduling ◽  
Idle Time ◽  
Dispatching Rules ◽  
Mixed Integer ◽  
Scheduling Problems

This research considers the problem of scheduling jobs on unrelated parallel machines with inserted idle times to minimize the earliness and tardiness. The aims at investigating how particular objective value can be improved by allowing machine idle time and how quality solutions can be more effectively obtained. Two mixed-integer programming formulations combining with three dispatching rules are developed to solve such scheduling problems. They can easy provide the optimal solution to problem involving about nine jobs and four machines. From the results of experiments, it is found that: (1) the inserted idle times decreases objective values more effectively; (2) three dispatching rules are very competitive in terms of efficiency and quality of solutions.

USING GENETIC ALGORITHMS TO SOLVE FUZZY FLOW SHOP SCHEDULING PROBLEMS BASED ON POSSIBILITY AND NECESSITY MEASURES

2008 ◽  
Vol 16 (03) ◽  
pp. 409-433 ◽  
Author(s):  
PENG-JEN LAI ◽  
HSIEN-CHUNG WU
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Fuzzy Sets Theory ◽  
Scheduling Problems ◽  
Due Dates ◽  
Objective Functions ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Fuzzy Processing Times ◽  
Sets Theory

The scheduling problems with fuzzy processing times and fuzzy due dates are investigated in this paper. The concepts of earliness and tardiness are interpreted by using the concepts of possibility and necessity measures that were developed in fuzzy sets theory. Many types of objective function will be taken into account through the different combinations of possibility and necessity measures. The purpose of this paper is to obtain the optimal schedules based on these objective functions. The genetic algorithm will be invoked to tackle these objective functions. Four numerical examples are also provided and solved by using the commercial software MATLAB.

A HYBRID PERMUTATION-CODED EVOLUTIONARY ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM

2010 ◽  
Vol 27 (06) ◽  
pp. 713-725 ◽  
Author(s):  
ALOK SINGH
Keyword(s):  
Genetic Algorithm ◽  
Steady State ◽  
Evolutionary Algorithm ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Idle Time ◽  
Scheduling Problem ◽  
Computational Results ◽  
Earliness And Tardiness

In this paper, we have proposed a hybrid permutation-coded steady-state genetic algorithm for a single machine scheduling problem with earliness and tardiness costs and no machine idle time. The steady-state genetic algorithm generates schedules, which are further improved by successive applications of an adjacent pairwise interchange procedure. We have compared our approach against the best approaches reported in the literature. Computational results show the effectiveness of our approach, since it obtained better quality solutions in shorter time.

Single Machine Multiple Common due Dates Assignment Based on Common Flow Allowance and Resource-Dependent Processing Times

2014 ◽  
Vol 644-650 ◽  
pp. 2022-2025
Author(s):  
Cheng Xin Luo ◽  
En Min Feng
Keyword(s):  
Single Machine ◽  
Optimal Algorithm ◽  
Due Dates ◽  
Due Date ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Resource Cost ◽  
The Common ◽  
Resource Allocation Scheme ◽  
Flow Allowance

This paper studies a multiple common due date assignment problem on a single machine. The job-dependent due dates are obtained based on common flow allowance criteria. We assume that the processing time of a job is controllable by the resource amount assigned to it. The objective is to find the optimal multiple common dues, the set of jobs assigned to each due date, the sequence of jobs and resource allocation scheme to minimize a total cost based on earliness and tardiness of jobs, the common dues and resource cost. We propose an optimal algorithm to solve the problem.

Sign in / Sign up

Export Citation Format

Share Document