A note: minmax due-date assignment problem with lead-time cost

DOI10.1016/J.COR.2013.03.004zbMATH Open1348.90293OpenAlexW2079438867MaRDI QIDQ336460FDOQ336460

Authors: Baruch Mor, Gur Mosheiov, Dvir Shabtay 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.03.004

Recommendations

• Minmax due-date assignment with a time window for acceptable lead-times
• Minmax due-date assignment on a two-machine flowshop
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
• Optimal due date assignment in multi-machine scheduling environments

zbMATH Keywords

schedulingsingle machineminmaxdue-date assignmentlead-time

Mathematics Subject Classification ID

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

Cites Work

• A survey of the state-of-the-art of common due date assignment and scheduling research
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Two-machine flow-shop scheduling with rejection
• On the complexity of generalized due date scheduling problems
• Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs
• Title not available (Why is that?)
• Optimal due date assignment in multi-machine scheduling environments
• Single machine common flow allowance scheduling with controllable processing times
• Job-dependent due-window assignment based on a common flow allowance
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single Machine Scheduling with Flow Allowances
• Two due date assignment problems in scheduling a single machine
• Minimizing the maximum deviation of job completion time about a common due-date
• An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
• Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
• A note on optimal assignment of slack due-dates in single-machine scheduling
• A note on the SPT heuristic for solving scheduling problems with generalized due dates
• Single machine scheduling with assignable due dates
• A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
• Optimal assignment of slack due-date and sequencing in a single machine shop
• Optimal assignment of slack due-dates and sequencing in a single-machine shop

Cited In (6)

• Due-date assignment with acceptable lead-times on parallel machines
• Minmax due-date assignment on a two-machine flowshop
• Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine
• Minmax due-date assignment with a time window for acceptable lead-times
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Minsum scheduling with acceptable lead-times and optional job rejection

This page was built for publication: A note: minmax due-date assignment problem with lead-time cost

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