Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
Summary: The number of just-in-time jobs maximization in a permutation flow shop scheduling problem is considered. A mixed integer linear programming model to represent the problem as well as solution approaches based on enumeration and constructive heuristics were proposed and computationally implemented. Instances with up to 10 jobs and five machines are solved by the mathematical model in an acceptable running time (3.3 min on average) while the enumeration method consumes, on average, 1.5 s. The 10 constructive heuristics proposed show they are practical especially for large-scale instances (up to 100 jobs and 20 machines), with very good-quality results and efficient running times. The best two heuristics obtain near-optimal solutions, with only 0.6\% and 0.8\% average relative deviations. They prove to be better than adaptations of the NEH heuristic (well-known for providing very good solutions for makespan minimization in flow shop) for the considered problem.
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Optimal job scheduling for flowshops
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- On the parameterized tractability of the just-in-time flow-shop scheduling problem
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- The just-in-time scheduling problem in a flow-shop scheduling system
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- A Note on Heuristics of Flow-Shop Scheduling
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- Benchmarks for basic scheduling problems
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Just-in-time systems.
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
- Note—A Note on Single Machine Sequencing with Random Processing Times
- Principles of Sequencing and Scheduling
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Scheduling. Theory, algorithms, and systems
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling to minimize the number of early and tardy jobs
- The just-in-time scheduling problem in a flow-shop scheduling system
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- A meta-heuristic to solve the just-in-time job-shop scheduling problem
- Editorial. Special issue on algorithms for scheduling problems
- A note on just-in-time scheduling on flow shop machines
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- scientific article; zbMATH DE number 2186533 (Why is no real title available?)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- The just-in-time scheduling problem in a flow-shop scheduling system
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- A systematic review of permutation flow shop scheduling with due-date-related objectives
This page was built for publication: Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331444)
