Scheduling deteriorating jobs with rejection on dominant machines

DOI10.1007/S11741-008-0601-3MaRDI QIDQ3640924zbMATH OpenOpenAlexFDO

Authors Yushao Cheng, Shijie Sun

Publication date 11 November 2009

Published in Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11741-008-0601-3

zbMATH Keywords

schedulingrejectiondeteriorating jobspermutation flow shopdominant machines

Mathematics Subject Classification ID

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

Recommendations

• Two-machine flow-shop scheduling with deterioration and rejection
• Scheduling deteriorating jobs on a single machine with release times and rejection
• Scheduling linear deteriorating jobs with rejection on a single machine
• Parallel-machine scheduling with deteriorating jobs and rejection
• Scheduling linear deteriorating jobs with rejection on a single machine and batch delivery

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 942479 (Why is no real title available?)
• scientific article; zbMATH DE number 871904 (Why is no real title available?)
• A concise survey of scheduling with time-dependent processing times
• Algorithms and Data Structures
• Complexity analysis of job-shop scheduling with deteriorating jobs
• Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• Flowshop scheduling with dominant machines
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• On-line uniform machine scheduling with rejection
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive multiprocessor scheduling with rejection
• Preemptive scheduling with rejection
• Scheduling with time dependent processing times: Review and extensions
• Techniques for scheduling with rejection

Cited in

(5)

• Flowshop scheduling with learning effect and job rejection
• Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
• Flow shop scheduling problems with deteriorating jobs under dominating machines
• Scheduling algorithm for permutation flowshop with limited waiting times and rejection
• Two-machine flow-shop scheduling with deterioration and rejection

This page was built for publication: Scheduling deteriorating jobs with rejection on dominant machines

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