Chemical Reaction Optimization for Earliness-Tardiness Scheduling Problem

Abstract

This paper studies a job shop scheduling problem on a single machine environment with an objective of minimizing the total weighed earliness and tardiness penalties. Jobs have distinct release dates and distinct due dates. A sequence-dependent setup times exists between two consecutive jobs. Jobs are punished if they are finished either before due dates or after due dates. A chemical reaction optimization method is proposed to solve the problem. An improved optimal timing is applied to fix the start time of each job under given sequence. Experimental results show that the proposed algorithm can solve this problem effectively.

A Hybrid Multi-Objective Teaching-Learning Based Optimization for Scheduling Problem of Hybrid Flow Shop With Unrelated Parallel Machine

“…In manufacturing shops, production scheduling plays an important role on achieving one or more manufacturing optimal objectives, such as minimizing the maximum completion time (makespan), mean flow time, earliness and tardiness. Flow-shop scheduling problem(FSP) is one of classical production scheduling problems and widely exists in chemical [1], metallurgy [2], micro-electronics [3], and so on. Hybrid flow shop with unrelated parallel machines (HFS) is an extension of FSP, but it is more complex than FSP, because at least in one stage there are multiple parallel…”