Flowshop scheduling with learning effect and job rejection

DOI10.1007/s10951-019-00612-yzbMath1456.90076OpenAlexW2963954604MaRDI QIDQ2215196

Gur Mosheiov, Baruch Mor, Dana Shapira

Publication date: 11 December 2020

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

Full work available at URL: https://doi.org/10.1007/s10951-019-00612-y

zbMATH Keywords

schedulingdynamic programminglearning effectproportionate flowshopjob rejection

Mathematics Subject Classification ID

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

Related Items (13)

Single machine scheduling with rejection and generalized parameters ⋮ Single machine scheduling with rejection to minimize the weighted makespan ⋮ Single machine scheduling with non-availability interval and optional job rejection ⋮ Minimizing total load on parallel machines with linear deterioration ⋮ Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility ⋮ Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost ⋮ Machine scheduling with job rejection and Dejong's learning effect ⋮ Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan ⋮ Order acceptance and scheduling with delivery under generalized parameters ⋮ Single machine lot scheduling with optional job-rejection ⋮ 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

• Faster algorithms for single machine scheduling with release dates and rejection
• A survey on offline scheduling with rejection
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
• Online scheduling of unit jobs on three machines with rejection: a tight result
• Time-dependent scheduling
• Single-machine scheduling under the job rejection constraint
• Single-machine scheduling with learning considerations
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• 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
• Multipurpose machine scheduling with rejection and identical job processing times
• Metaheuristics for a scheduling problem with rejection and tardiness penalties
• Scheduling with release times and rejection on two parallel machines
• A state-of-the-art review on scheduling with learning effects
• An improved heuristic for parallel machine scheduling with rejection
• Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
• Scheduling problems with a learning effect

This page was built for publication: Flowshop scheduling with learning effect and job rejection