Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates

DOI10.1007/s10951-021-00697-4zbMath1480.90136OpenAlexW3184810401MaRDI QIDQ2066679

Dvir Shabtay, Gur Mosheiov, Baruch Mor

Publication date: 14 January 2022

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-021-00697-4

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Single machine scheduling with rejection and generalized parameters ⋮ Single machine scheduling with rejection to minimize the weighted makespan ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan ⋮ Order acceptance and scheduling with delivery under generalized parameters

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on offline scheduling with rejection
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• Single-machine scheduling under the job rejection constraint
• On the complexity of generalized due date scheduling problems
• Minimizing total weighted completion time in a proportionate flow shop
• Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
• A note on the SPT heuristic for solving scheduling problems with generalized due dates
• Single machine scheduling with assignable due dates
• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
• On the parameterized tractability of single machine scheduling with rejection
• Flowshop scheduling with learning effect and job rejection
• Two-agent single-machine scheduling with assignable due dates
• Regular scheduling measures on proportionate flowshop with job rejection
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Algorithms for Scheduling Independent Tasks
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization