Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling

DOI10.3390/a11040043zbMath1461.90047OpenAlexW2795923574WikidataQ130000698 ScholiaQ130000698MaRDI QIDQ2331444

Socorro Rangel, Helio Yochihiro Fuchigami, Ruhul A. Sarker

Publication date: 29 October 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a11040043

zbMATH Keywords

heuristicsflow shopjust-in-time scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ Editorial. Special issue on algorithms for scheduling problems

Cites Work

• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
• The just-in-time scheduling problem in a flow-shop scheduling system
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• Just-in-time systems.
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• Single machine scheduling to minimize the number of early and tardy jobs
• Benchmarks for basic scheduling problems
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
• Sequencing with Earliness and Tardiness Penalties: A Review
• Principles of Sequencing and Scheduling
• Note—A Note on Single Machine Sequencing with Random Processing Times
• Scheduling

This page was built for publication: Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling