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-1MaRDI QIDQ1730596zbMATH OpenOpenAlexFDO

Authors Baruch Mor, Gur Mosheiov

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

job-rejectionposition-dependent processing timesschedulingtotal absolute deviation of completion timesunrelated machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
• Total absolute deviation of job completion times on uniform and unrelated machines
• Scheduling on parallel identical machines with job-rejection and position-dependent processing times
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

Cites work

• A survey on offline scheduling with rejection
• An improved heuristic for parallel machine scheduling with rejection
• Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
• scientific article; zbMATH DE number 493076 (Why is no real title available?)
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• 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
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Multiagent scheduling. Models and algorithms
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Research on permutation flow shop scheduling problems with general position-dependent learning effects
• Scheduling problems with position dependent job processing times: computational complexity results
• Scheduling with job-dependent learning effects and multiple rate-modifying activities
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
• Scheduling with release times and rejection on two parallel machines
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
• Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
• Single-machine scheduling problems with past-sequence-dependent setup times
• Single-machine scheduling with both deterioration and learning effects
• Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis
• Time-dependent scheduling
• Total absolute deviation of job completion times on uniform and unrelated machines

Cited in

(14)

• 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
• Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
• Flowshop scheduling with learning effect and job rejection
• Regular scheduling measures on proportionate flowshop with job rejection
• Minmax scheduling problems with common due-date and completion time penalty
• On the completion time and the interruption time of a job processed on an unreliable machine
• Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
• Total absolute deviation of job completion times on uniform and unrelated machines
• 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
• Scheduling problems on parallel dedicated machines with non-renewable resource

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

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