Maximizing the weighted number of just-in-time jobs in flow shop scheduling
From MaRDI portal
Publication:835569
DOI10.1007/S10951-007-0030-ZzbMATH Open1168.90431OpenAlexW1967455912MaRDI QIDQ835569FDOQ835569
Authors: Byung-Cheon Choi, Suk-Hun Yoon 
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
Recommendations
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- A note on just-in-time scheduling on flow shop machines
- 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
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing the weighted number of tardy jobs on a single machine
- Title not available (Why is that?)
- 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
- Minimizing the weighted number of tardy jobs on a two-machine flow shop.
- Scheduling shops to minimize the weighted number of late jobs
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Single machine scheduling to minimize the number of early and tardy jobs
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Minimizing the weighted number of tardy jobs on parallel processors
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
Cited In (22)
- 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
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- The just-in-time scheduling problem in a flow-shop scheduling system
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
- A just-in-time scheduling problem with two competing agents
- Title not available (Why is that?)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Multi-agent scheduling in a no-wait flow shop system 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
- A state-of-the-art survey on multi-scenario scheduling
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- Maximizing Throughput in Flow Shop Real-Time Scheduling
- 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
- Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence
- Two-agent single-machine scheduling problem with just-in-time jobs
- Scheduling unit processing time jobs on an m-machine flow-shop
- Minimizing the weighted number of tardy jobs on multiple machines: a review
This page was built for publication: Maximizing the weighted number of just-in-time jobs in flow shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835569)
