NDLI: Dynamic Local Focusing Approach for Production Scheduling Problems

Content Provider	IEEE Xplore Digital Library
Author	Ping Gu Yajie Lou Xuerui Zhang Fujimura, S.
Copyright Year	2007
Description	Author affiliation: Waseda Univ., Kitakyushu (Ping Gu; Yajie Lou; Xuerui Zhang; Fujimura, S.)
Abstract	Although decomposition procedure is a common approach to handle computational complexity which is caused by large scale production scheduling problems, in order to extend the applicability of the decomposition approach, the overall problem should be decomposed on which criterion is always a problem. Also how to improve decomposition approach's computational efficiency and resultant effectiveness is still a challenging task in this field. With the purpose of improving decomposition approach's efficiency and decreasing computational complexity for job shop scheduling problems, a new dynamic local focusing approach which has a machine-based divided criterion focused on the longest active chain is proposed in this paper. Not liking the used decomposition procedure, the proposed one does not decompose a job shop into cells at the very beginning. It dynamically classifies the machines, which process operations on the identified longest active chain of the whole problem as one focused cell (decomposed sub-problem). The schedule is improved by redefining, adjusting and solving the focused cell schedule which is updated iteratively with the entire schedule's longest active chain in this dynamic procedure. The proposed approach is tested on make-span minimum benchmark job shop scheduling problems. Test results show that the algorithm is capable of efficiently generating good schedules.
Starting Page	466
Ending Page	471
File Size	343151
Page Count	6
File Format	PDF
ISBN	9781424411535
DOI	10.1109/COASE.2007.4341798
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-09-22
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Production Dynamic scheduling Job shop scheduling Processor scheduling Computational complexity Large-scale systems Computational efficiency Benchmark testing Iterative algorithms Scheduling algorithm
Content Type	Text
Resource Type	Article

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

Large-scale flow shop scheduling based on genetic algorithm

A partial-clustering based algorithm for iterative partial-decomposition of large scale job shops scheduling problems

Rolling Horizon Procedure for Large-scale Job-shop Scheduling Problems

Algorithm comparison for manufacturing scheduling problems

A Multi-objective PSO for job-shop scheduling problems

Distributed simulated annealing algorithms for job shop scheduling

A novel initialization method for solving Flexible Job-shop Scheduling Problem

An efficient search method for job-shop scheduling problems

A New Beam Search Algorithm for the Large-Scale Permutation FSP

Dynamic Local Focusing Approach for Production Scheduling Problems

Similar Documents

Large-scale flow shop scheduling based on genetic algorithm

A partial-clustering based algorithm for iterative partial-decomposition of large scale job shops scheduling problems

Rolling Horizon Procedure for Large-scale Job-shop Scheduling Problems

Algorithm comparison for manufacturing scheduling problems

A Multi-objective PSO for job-shop scheduling problems

Distributed simulated annealing algorithms for job shop scheduling

A novel initialization method for solving Flexible Job-shop Scheduling Problem

An efficient search method for job-shop scheduling problems

A New Beam Search Algorithm for the Large-Scale Permutation FSP

Dynamic Local Focusing Approach for Production Scheduling Problems