ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
From MaRDI portal
Publication:4006129
DOI10.15807/jorsj.34.354zbMath0747.90048OpenAlexW2144140781MaRDI QIDQ4006129
Publication date: 26 September 1992
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.34.354
Related Items
Machine scheduling with job delivery coordination ⋮ Resolution of a scheduling problem in a flowshop robotic cell ⋮ Scheduling in reentrant robotic cells: algorithms and complexity ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ Coordinating multi-location production and customer delivery ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ A two-stage flow shop scheduling problem with transportation considerations ⋮ An improved approximation algorithm for a scheduling problem with transporter coordination ⋮ New complexity results on scheduling problem in a robotic cell ⋮ Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ Tabu search algorithms for job-shop problems with a single transport robot ⋮ Makespan minimization for flow-shop problems with transportation times and a single robot ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
