Optimal job scheduling for flowshops

MaRDI QIDQ1287338zbMATH OpenFDO

Authors V. I. Levin, I. Yu. Miretskiĭ

Publication date 24 May 1999

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundflowshopstime sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1911010
• Methods of sequencing in job shops -- a review
• scientific article; zbMATH DE number 3854789
• A survey of methods for the solution of problems of scheduling theory
• An efficient heuristic approach to the scheduling of jobs in a flowshop

Cited in

(20)

• An efficient heuristic approach to the scheduling of jobs in a flowshop
• Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
• Optimal job insertion in the no-wait job shop
• Flowshop scheduling research after five decades
• Ordering of jobs with three different processing times in the \(Mxn\) Bellman-Johnson problem
• scientific article; zbMATH DE number 2186533 (Why is no real title available?)
• scientific article; zbMATH DE number 4172728 (Why is no real title available?)
• scientific article; zbMATH DE number 4147845 (Why is no real title available?)
• From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
• Improving job-shop schedules through critical pairwise exchanges
• scientific article; zbMATH DE number 1786162 (Why is no real title available?)
• A new approach to computing optimal schedules for the job-shop scheduling problem
• Sequencing and scheduling in flowshops with task redistribution
• scientific article; zbMATH DE number 2156294 (Why is no real title available?)
• scientific article; zbMATH DE number 1911010 (Why is no real title available?)
• How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
• Methods of sequencing in job shops -- a review
• Maximizing Throughput in Flow Shop Real-Time Scheduling
• Scheduling semi-malleable jobs to minimize mean flow time
• A filter-and-fan approach to the job shop scheduling problem

This page was built for publication: Optimal job scheduling for flowshops

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