NDLI: A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization

Content Provider	Springer Nature Link
Author	Topaloglu, Seyda Kilincli, Gamze
Copyright Year	2008
Abstract	This paper proposes a modified shifting bottleneck heuristic (MSBH) for the reentrant job shop scheduling problem (RJSSP) with makespan minimization objective. Recently, the reentrant job shop has come into prominence as a new type of manufacturing shop. The principle characteristic of a reentrant job shop is that a job may visit certain machines more than once during the process flow, whereas in the classic job shop, each job visits a machine only once. The shifting bottleneck heuristic (SBH) is one of the most successful heuristic approaches for the classical job shop scheduling problem, which decomposes the problem into a number of single-machine subproblems. This paper adapts the SBH for the RJSSP and proposes a new sequencing heuristic for the single-machine maximum lateness subproblem considering the reentrant jobs in order to handle large-size RJSSPs. It also uses a subproblem criticality measure that further shortens the implementation time. The proposed MSBH is tested by using instances up to 20 machines and 100 jobs, and it is illustrated that good quality solutions can be obtained in reasonable computational times. A real-life application of the MSBH is also given as a case study to evaluate its performance.
Starting Page	781
Ending Page	794
Page Count	14
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	44
Issue Number	7-8
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2009-01-09
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Reentrant job shop scheduling problem Shifting bottleneck heuristic Makespan minimization Single-machine maximum lateness problem Computer-Aided Engineering (CAD, CAE) and Design Mechanical Engineering Production/Logistics Industrial and Production Engineering
Content Type	Text
Resource Type	Article
Subject	Industrial and Manufacturing Engineering Control and Systems Engineering Mechanical Engineering Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization

A heuristic algorithm for solving flexible job shop scheduling problem

Scheduling of a hub reentrant job shop to minimize makespan

GA based heuristic for the open job shop scheduling problem

Parallel line job shop scheduling using genetic algorithm

A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems

An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling

Makespan minimization in a job shop with a BPM using simulated annealing

A study of the flexible job shop scheduling problem with parallel machines and reentrant process

A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization

Similar Documents

A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization

A heuristic algorithm for solving flexible job shop scheduling problem

Scheduling of a hub reentrant job shop to minimize makespan

GA based heuristic for the open job shop scheduling problem

Parallel line job shop scheduling using genetic algorithm

A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems

An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling

Makespan minimization in a job shop with a BPM using simulated annealing

A study of the flexible job shop scheduling problem with parallel machines and reentrant process

A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization