OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP

DOI10.15807/JORSJ.40.356MaRDI QIDQ4366147zbMATHOpenAlexFDO

Authors Jinliang Cheng, Yoshiyuki Karuno, Hiroshi Kise

Publication date 7 September 1998

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.40.356

zbMATH Keywords

heuristic algorithmbranch-and-boundfuzzy approximationautomated flowshop manufacturing system

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• scientific article; zbMATH DE number 2050744
• An efficient heuristic approach to the scheduling of jobs in a flowshop
• Optimal results and numerical simulations for flow shop scheduling problems

Cited in

(7)

• Multilevel intelligent scheduling and control system for an automated flow shop manufacturing environment
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• Optimization framework for process scheduling of operation-dependent automobile assembly lines
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines
• Optimal four-machine flow shop scheduling with dominance condition
• Optimal scheduling of the 3-machine assembly-type flow shop

This page was built for publication: OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366147)