Maximizing the weighted number of just-in-time jobs in flow shop scheduling
From MaRDI portal
Publication:835569
DOI10.1007/s10951-007-0030-zzbMath1168.90431OpenAlexW1967455912MaRDI QIDQ835569
Suk-Hun Yoon, Byung-Cheon Choi
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0030-z
Related Items (17)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem ⋮ Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times ⋮ Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ A note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems ⋮ A just-in-time scheduling problem with two competing agents ⋮ Maximizing Throughput in Flow Shop Real-Time Scheduling ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ On the parameterized tractability of the just-in-time flow-shop scheduling problem ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
Cites Work
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Minimizing the weighted number of tardy jobs on a single machine
- Minimizing the weighted number of tardy jobs on parallel processors
- Scheduling shops to minimize the weighted number of late jobs
- Single machine scheduling to minimize the number of early and tardy jobs
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximizing the weighted number of just-in-time jobs in flow shop scheduling
