Single-machine Scheduling Problems with Learning Effects in Intermittent Batch Production
|School||Qufu Normal University|
|Course||Operational Research and Cybernetics|
|Keywords||Sequence Learning effect Forgetting Effect Intermittent batch production Stand-alone|
Has since Biskup (1999) introduced into the learning effect scheduling problem with a learning effect scheduling problem by the extensive attention of scholars at home and abroad , which has become a research active sort branch has broad application prospects . In this paper, this research base to explore the intermittent batch production in the machine has Dejong learning effect , these three types of model of the time-dependent learning effect and general learning effect under single machine scheduling problem . The paper is organized as follows : The first chapter introduces some of the concepts of the scheduling problem and related symbols , given the required prior knowledge , and a brief description of the main results of this study and innovation . The second chapter discusses the conditions under intermittent batch production machine with Dejong learning effect , the objective function is makespan and total completion time single machine scheduling problem . With the passage of time in the production process operation , the machine will appear forgetting effect . According to the strength of the forgetting effect appears , to consider between batches does not the learning effect transfer , the transfer of part of the learning effect and the transfer of the total learning effect these three situations . Polynomial time algorithm is given between batches , no transfer of learning effect and the transfer of part of the learning effect in both cases single machine scheduling problem , and prove the optimality of the algorithm . Some special cases the total learning effect passed between batches given a polynomial time algorithm Chapters III and IV , respectively, intermittent batch production machine has the learning effect of time-related and general learning effect conditions, the objective function is makespan and total completion time single machine scheduling problem . We consider the transfer of learning effect and two cases of the transfer of part of the learning effect between batches . Considered sort are given a polynomial time algorithm , and prove the optimality of the algorithm .