A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop

DOI10.1016/J.IPL.2014.09.004MaRDI QIDQ477611zbMATH OpenOpenAlexFDO

Authors Enrique Gerstl, Baruch Mor, Gur Mosheiov

Publication date 9 December 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2014.09.004

zbMATH Keywords

schedulingjust-in-timeproportionate flowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Maximizing the weighted number of just-in-time jobs in flow shop scheduling
• A note: maximizing the weighted number of just-in-time jobs for a given job sequence
• Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system
• 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~several two-machine scheduling systems
• An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem
• A note: minimizing maximum earliness on a proportionate flowshop
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
• A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights

Cites work

• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds
• Minimizing total weighted completion time in a proportionate flow shop
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Review of the ordered and proportionate flow shop scheduling research
• Scheduling. Theory, algorithms, and systems.
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Single machine scheduling to minimize the number of early and tardy jobs
• The Three-Machine No-Wait Flow Shop is NP-Complete
• The just-in-time scheduling problem in a flow-shop scheduling system
• The three-machine proportionate flow shop problem with unequal machine speeds

Cited in

(13)

• A survey of scheduling problems with no-wait in process
• 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
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
• Scheduling a proportionate flow shop of batching machines
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
• Regular scheduling measures on proportionate flowshop with job rejection
• A note: minimizing maximum earliness on a proportionate flowshop
• The proportionate flow shop total tardiness 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
• Minimizing the weighted number of tardy jobs on multiple machines: a review

This page was built for publication: A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop

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