A note: maximizing the weighted number of just-in-time jobs for a given job sequence

DOI10.1007/S10951-022-00772-4MaRDI QIDQ6136084zbMATH OpenOpenAlexFDO

Authors Enrique Gerstl, Gur Mosheiov

Publication date 28 August 2023

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-022-00772-4

zbMATH Keywords

dynamic programmingschedulingsingle machinejust-in-timeflowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• 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 flow shop scheduling
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• Minimizing the maximum of job with weighted lateness in a single machine problem
• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem

Cites work

• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• 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 in flow shop scheduling
• Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Reducibility among combinatorial problems
• Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution
• Single machine scheduling to minimize the number of early and tardy jobs
• The just-in-time scheduling problem in a flow-shop scheduling system
• The open shop scheduling problem with a given sequence of jobs on one machine
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs

Cited in

(10)

• Scheduling of parallel identical machines 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
• Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
• A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• 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
• Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop

This page was built for publication: A note: maximizing the weighted number of just-in-time jobs for a given job sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136084)