Regular scheduling measures on proportionate flowshop with job rejection

DOI10.1007/s40314-020-1130-zzbMath1449.90116OpenAlexW3011290384MaRDI QIDQ2307854

Dana Shapira, Baruch Mor

Publication date: 25 March 2020

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-020-1130-z

zbMATH Keywords

schedulingdynamic programmingproportionate flowshopjob rejectionregular performance measures

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection ⋮ Single machine lot scheduling with optional job-rejection ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs

Cites Work

• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• A survey on offline scheduling with rejection
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
• A note: minimizing maximum earliness on a proportionate flowshop
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
• Single-machine scheduling under the job rejection constraint
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
• Flowshop scheduling with learning effect and job rejection
• Scheduling with release times and rejection on two parallel machines
• Review of the ordered and proportionate flow shop scheduling research
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Proportionate flow shop: New complexity results and models with due date assignment
• Proportionate Flow Shop Scheduling with Rejection
• Scheduling