Maximizing the weighted number of just-in-time jobs in flow shop scheduling

DOI10.1007/S10951-007-0030-ZMaRDI QIDQ835569zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

schedulingNP-completejust-in-time jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• Introduction to algorithms.
• Minimizing the weighted number of tardy 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 parallel processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• Scheduling shops to minimize the weighted number of late jobs
• 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

Cited in

(25)

• 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
• 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
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• A just-in-time scheduling problem with two competing agents
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
• scientific article; zbMATH DE number 2186533 (Why is no real title available?)
• 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
• Just-in-time scheduling in two-stage flexible flow shops
• A note on just-in-time scheduling on flow shop machines
• Two-agent single-machine scheduling problem with just-in-time jobs
• Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop
• 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)