Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
From MaRDI portal
Publication:1383140
DOI10.1023/A:1018948621875zbMath0896.90138OpenAlexW1923211672MaRDI QIDQ1383140
Ling Gou, Makoto Tsuji, Toshiyuki Kano, Takaaki Nagahora, Peter B. Luh, Kiyoshi Yoneda, Yuanhui Zhang, Yuji Kyoya, Tetsuo Hasegawa
Publication date: 2 April 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018948621875
Lagrangian relaxationjob shop schedulingfinite bufferslong time horizonmachines with setupsoptimization-based scheduling
Related Items
Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness, A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness, Optimizing memory allocation for multistage scheduling including setup times, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, Scheduling of continuous and discontinuous material flows with intermediate storage restrictions, An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns, Scheduling job shop problems with sequence-dependent setup times, Steel-making process scheduling using Lagrangian relaxation, A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
