A note: minimizing maximum earliness on a proportionate flowshop

DOI10.1016/J.IPL.2014.09.023zbMath1302.90088OpenAlexW2062047304MaRDI QIDQ477650

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)

Related Items (4)

The proportionate flow shop total tardiness problem ⋮ On the complexity of proportionate open shop and job shop problems ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs

Cites Work

• 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
• Tactically delayed versus non-delay scheduling: An experimental investigation
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Minimizing total weighted completion time in a proportionate flow shop
• Single machine scheduling to minimize the number of early and tardy jobs
• Review of the ordered and proportionate flow shop scheduling research
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• 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: minimizing maximum earliness on a proportionate flowshop