Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study

Authors:
V. Vinod;R. Sridharan
Affiliations:
Department of Mechanical Engineering, N.S.S. College of Engineering , P.O. 678008, Palakkad, Kerala, India;Department of Mechanical Engineering, National Institute of Technology Calicut, N. I. T. Campus, P.O. 673601, Calicut, Kerala, India
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2008

Citing 3
Cited 6

Scheduling in job shops with machine breakdowns: an experimental study

Computers and Industrial Engineering
Simulation Modeling and Analysis

Simulation Modeling and Analysis
Dynamic rescheduling that simultaneously considers efficiency and stability

Computers and Industrial Engineering

Analyzing the behaviors of virtual cells (VCs) and traditional manufacturing systems: Ant colony optimization (ACO)-based metamodels

Computers and Operations Research
Evaluating the effectiveness of FDM in identifying important factors in a dynamic flowshop

Robotics and Computer-Integrated Manufacturing
Multi-objective scheduling of dynamic job shop using variable neighborhood search

Expert Systems with Applications: An International Journal
A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

Applied Soft Computing
A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem

Expert Systems with Applications: An International Journal
Intelligent controllers for bi-objective dynamic scheduling on a single machine with sequence-dependent setups

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the salient aspects of a simulation-based experimental study of scheduling rules for scheduling a dynamic job shop in which the setup times are sequence dependent. A discrete event simulation model of the job shop system is developed for the purpose of experimentation. Seven scheduling rules from the literature are incorporated in the simulation model. Five new setup-oriented scheduling rules are proposed and implemented. Simulation experiments have been conducted under various experimental conditions characterized by factors such as shop load, setup time ratios and due date tightness. The results indicate that setup-oriented rules provide better performance than ordinary rules. The difference in performance between these two groups of rules increases with increase in shop load and setup time ratio. One of the proposed rules performs better for mean flow time and mean tardiness measures.