Multiple-Machine Scheduling with Learning Effects and Cooperative Games

Abstract

Multiple-machine scheduling problems with position-based learning effects are studied in this paper. There is an initial schedule in this scheduling problem. The optimal schedule minimizes the sum of the weighted completion times; the difference between the initial total weighted completion time and the minimal total weighted completion time is the cost savings. A multiple-machine sequencing game is introduced to allocate the cost savings. The game is balanced if the normal processing times of jobs that are on the same machine are equal and an equal number of jobs are scheduled on each machine initially.

Formulations, Features of Solution Space, and Algorithms for Line-PureSeruSystem Conversion

“…Mathematical Problems in Engineering determines which product batches are dispatched to the serus formed in seru-formation [26,27]. A feasible solution of seru-load must satisfy seru-load constraint, that is, ( 13) and (14).…”

Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date

“…B. Wang and J. J. Wang [17] investigate flowshop scheduling problems with a general exponential learning effect. Zhou and Zhang [18] consider the cooperative games based on multiple-machine scheduling problems with learning effects. Zhang et al [19] propose a group scheduling model with deteriorating and learning effect on a single machine.…”