NDLI: Job shop scheduling with group-dependent setups, finite buffers, and long time horizon

Content Provider	Springer Nature Link
Author	Luh, Peter B. Gou, Ling Zhang, Yuanhui Nagahora, Takaaki Tsuji, Makoto Yoneda, Kiyoshi Hasegawa, Tetsuo Kyoya, Yuji Ka, Toshiyuki
Copyright Year	1998
Abstract	Scheduling is a key factor for manufacturing productivity. Effective scheduling can improve on-time delivery of products, reduce inventory, cut lead times, and improve the utilization of bottleneck resources. This study was motivated by the design and implementation of a scheduling system for the manufacturing of Toshiba's gas insulated switchgears. The manufacturing is characterized by significant machine setup times, strict local buffer capacities, the option of choosing a few alternative processing routes, and long horizon as compared to the time resolution required. This problem has been recognized to be extremely difficult because of the combinatorial nature of integer optimization and the large size of the real problem. Our goal is thus to obtain near-optimal schedules with quantifiable quality in a computationally efficient manner. To achieve this goal, a novel integer optimization formulation with a separable structure is developed, and a solution methodology based on a combined Lagrangian relaxation, dynamic programming, and heuristics is developed. The method has been implemented using the object-oriented programming language C++, and numerical testing shows that the method generates high-quality schedules in a timely fashion to achieve on-time delivery of products and low inventory. Through explicit consideration of setups, tanks with the same processing requirements tend to be processed together to avoid excessive setups. The integrated treatment of machines and buffers facilitates the smooth flow of parts through the system. The embedded routing selection mechanism also balances the load among candidate routes. Finally, the newly developed "time step reduction technique" implicitly establishes two time scales to reduce computational requirements without much loss of modeling accuracy and scheduling performance, thereby enabling the resolution of long horizon problems with controllable computational requirements.
Starting Page	233
Ending Page	259
Page Count	27
File Format	PDF
ISSN	02545330
Journal	Annals of Operations Research
Volume Number	76
Issue Number	0
e-ISSN	15729338
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	1998-01-01
Publisher Place	Dordrecht
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Theory of Computation Combinatorics Operation Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research

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

Job shop scheduling with separable sequence-dependent setups

Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times

Cyclic job shop scheduling problems with blocking

Practical job shop scheduling

Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints

A search space analysis of the Job Shop Scheduling Problem

Preemptive scheduling with finite capacity input buffers

Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment

A branch and bound method for the job-shop problem with sequence-dependent setup times

Job shop scheduling with group-dependent setups, finite buffers, and long time horizon

Similar Documents

Job shop scheduling with separable sequence-dependent setups

Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times

Cyclic job shop scheduling problems with blocking

Practical job shop scheduling

Heuristic algorithms for job‐shop scheduling problemswith stochastic precedence constraints

A search space analysis of the Job Shop Scheduling Problem

Preemptive scheduling with finite capacity input buffers

Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment

A branch and bound method for the job-shop problem with sequence-dependent setup times

Job shop scheduling with group-dependent setups, finite buffers, and long time horizon