An order scheduling problem with position-based learning effect

DOI10.1016/J.COR.2016.04.021MaRDI QIDQ342484zbMATH OpenOpenAlexFDO

Authors Jianyou Xu, Chin-Chia Wu, Yunqiang Yin, Yi-Tang Chiou, Win-Chin Lin, Chuanli Zhao

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2016.04.021

zbMATH Keywords

simulated annealingtardinesslearning effectorder schedulingparticle swarm optimization method

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
• scientific article; zbMATH DE number 6000948
• A bi-criterion single-machine scheduling problem with learning considerations
• Scheduling problems with a learning effect

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
• A state-of-the-art review on scheduling with learning effects
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
• Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
• Coordinated scheduling of customer orders for quick response
• Flowshop scheduling with a general exponential learning effect
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations
• Optimization by simulated annealing
• Order scheduling in an environment with dedicated resources in parallel
• Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime
• Research on permutation flow shop scheduling problems with general position-dependent learning effects
• Scheduling orders for multiple product types to minimize total weighted completion time
• Scheduling orders for multiple product types with due date related objectives
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• Scheduling parallel machines for the customer order problem
• Several flow shop scheduling problems with truncated position-based learning effect
• Single machine scheduling with learning effect considerations
• Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects
• Single-machine and two-machine flowshop scheduling with general learning functions
• Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
• Single-machine scheduling with learning considerations
• Some scheduling problems with general position-dependent and time-dependent learning effects
• The single-machine total weighted tardiness scheduling problem with position-based learning effects

Cited in

(16)

• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration
• Minimizing maximum delivery completion time for order scheduling with rejection
• Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
• Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures
• Metaheuristics for order scheduling problem with unequal ready times
• Order scheduling with tardiness objective: improved approximate solutions
• Group scheduling with learning effect and random processing time
• Tailoring customer order scheduling search algorithms
• Approximation algorithms for some position-dependent scheduling problems
• A bicriteria approach for single machine scheduling with resource allocation, learning effect and a deteriorating maintenance activity
• A learning-based two-stage optimization method for customer order scheduling
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme
• Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
• An optimal online algorithm for scheduling with learning consideration
• An optimal online algorithm for single-processor scheduling problem with learning effect
• Group scheduling problems with time-dependent and position-dependent DeJong's learning effect

This page was built for publication: An order scheduling problem with position-based learning effect

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