A note: minimizing maximum earliness on a proportionate flowshop

DOI10.1016/J.IPL.2014.09.023MaRDI QIDQ477650zbMATH OpenOpenAlexFDO

Authors 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.023

zbMATH Keywords

schedulingproportionate flowshopminmax earliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• Proportionate flowshops with general position-dependent processing times
• An algorithm for minimizing flow time and maximum earliness on a single machine

Cites work

• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• 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 hybrid flowshops to minimize maximum tardiness or maximum completion time
• Scheduling. Theory, algorithms, and systems.
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Single machine scheduling to minimize the number of early and tardy jobs
• Tactically delayed versus non-delay scheduling: An experimental investigation
• The just-in-time scheduling problem in a flow-shop scheduling system

Cited in

(6)

• Regular scheduling measures on proportionate flowshop with job rejection
• On the complexity of proportionate open shop and job shop problems
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• The proportionate flow shop total tardiness problem

This page was built for publication: A note: minimizing maximum earliness on a proportionate flowshop

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