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

DOI10.1016/J.IPL.2014.09.004zbMath1302.90081OpenAlexW1981229180MaRDI QIDQ477611

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)

Related Items (10)

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 ⋮ The proportionate flow shop total tardiness problem ⋮ 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 note: maximizing the weighted number of just-in-time jobs for a given job sequence ⋮ A note: minimizing maximum earliness on a proportionate flowshop ⋮ A survey of scheduling problems with no-wait in process ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling

Cites Work

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

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