On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
From MaRDI portal
Publication:6094306
DOI10.1080/0305215x.2020.1735380zbMath1523.90188OpenAlexW3012330444MaRDI QIDQ6094306
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2020.1735380
Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
Minsum scheduling with acceptable lead-times and optional job rejection ⋮ A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ Equitable scheduling on a single machine ⋮ Single machine lot scheduling with optional job-rejection
This page was built for publication: On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops