A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection

DOI10.1007/s10479-018-2779-1zbMath1434.90064OpenAlexW2791601034MaRDI QIDQ1730596

Gur Mosheiov, Baruch Mor

Publication date: 6 March 2019

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

Full work available at URL: https://doi.org/10.1007/s10479-018-2779-1

zbMATH Keywords

schedulingunrelated machinesposition-dependent processing timesjob-rejectiontotal absolute deviation of completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ Minmax scheduling problems with common due-date and completion time penalty ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection ⋮ Flowshop scheduling with learning effect and job rejection ⋮ Single machine lot scheduling with optional job-rejection ⋮ Minimizing total late work on a single machine with generalized due-dates ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads

Cites Work

• Unnamed Item
• A survey on offline scheduling with rejection
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Total absolute deviation of job completion times on uniform and unrelated machines
• Scheduling with job-dependent learning effects and multiple rate-modifying activities
• Time-dependent scheduling
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
• Scheduling problems with position dependent job processing times: computational complexity results
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• Single-machine scheduling with both deterioration and learning effects
• Scheduling with release times and rejection on two parallel machines
• Research on permutation flow shop scheduling problems with general position-dependent learning effects
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
• Single-machine scheduling problems with past-sequence-dependent setup times
• An improved heuristic for parallel machine scheduling with rejection
• Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
• Minimizing Variation of Flow Time in Single Machine Systems
• Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
• Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis
• Multiagent Scheduling

This page was built for publication: A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection