Minmax due-date assignment on a two-machine flowshop

DOI10.1007/s10479-021-04212-yzbMath1476.90130OpenAlexW3195203789MaRDI QIDQ2241579

Gur Mosheiov, Baruch Mor

Publication date: 9 November 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04212-y

zbMATH Keywords

schedulingtwo-machine flowshopminmaxdue-date assignment

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items

Single machine slack due window assignment and deteriorating jobs

Cites Work

• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• A note: minmax due-date assignment problem with lead-time cost
• Due-window assignment scheduling in the proportionate flow shop setting
• Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• Minimizing the maximum deviation of job completion time about a common due-date
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• A note on a due-date assignment on a two-machine flow-shop
• Minmax due-date assignment with a time window for acceptable lead-times
• A survey on scheduling problems with due windows
• Optimal two- and three-stage production schedules with setup times included
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• CON/SLK due date assignment and scheduling on a single machine with two agents
• Single Machine Scheduling with Flow Allowances