2020•AIP conference proceedingsRequires access

Parallel machines with rescheduling, fixed due date, machine breakdown to reduce makespan and tardiness

V. Poongothai, P. Godhandaraman, P. Jayashri

Abstract

We consider a parallel machine with rescheduling, fixed due date, machine breakdown to reduce the makespan and tardiness. If any of the jobs affected, due to the machine breakdown it will be rescheduled. Reschedule is measured by the total tardiness is based on the original makespan due date. In industry, the scheduling with fixed due dates are commonly used. In this article, a mixed integer program is formulated. The problem has been solved effectively using the Hybrid Genetic Algorithm. The performance measure has been analyzed for comparing the various types of the algorithms

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Tardiness, Job shop scheduling, Scheduling (production processes), Computer science, Integer programming, Mathematical optimization, Genetic algorithm, Algorithm