Multiple-machine scheduling with learning effects and cooperative games
Summary: 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.
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- A note on single-machine scheduling with decreasing time-dependent job processing times
- A state-of-the-art review on scheduling with learning effects
- Balancedness of multiple machine sequencing games revisited
- Balancedness of sequencing games with multiple parallel machines
- Batch sequencing and cooperation
- Convex games with an infinite number of players and sequencing situations
- Drop out monotonic rules for sequencing situations
- Family sequencing and cooperation
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- scientific article; zbMATH DE number 2119001 (Why is no real title available?)
- Job scheduling, cooperation, and control
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- On a new class of parallel sequencing situations and related games
- On games corresponding to sequencing situations with ready times
- On the balancedness of multiple machine sequencing games
- On the balancedness of relaxed sequencing games
- On the convexity of games corresponding to sequencing situations with due dates.
- On the convexity of precedence sequencing games
- Parallel machine scheduling with a learning effect
- Permutation games: Another class of totally balanced games
- Relaxed sequencing games have a nonempty core
- Scheduling jobs with position-dependent processing times
- Scheduling with general job-dependent learning curves.
- Sequencing and Cooperation
- Sequencing games
- Sequencing games with controllable processing times
- Sequencing games without initial order
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- Single-machine scheduling problems with a learning effect
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Single-machine scheduling with learning considerations
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- The split core for sequencing games
- Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date
- Cost allocation in rescheduling with machine unavailable period
- Formulations, features of solution space, and algorithms for line-pure \textit{seru} system conversion
- Open shop scheduling games
- Family sequencing and cooperation
- Job scheduling, cooperation, and control
- Cooperative sequencing games with position-dependent learning effect
- Makespan scheduling on two-person cooperative games with position-dependent processing times
- Sequencing and Cooperation
- Human-Machine Collaborative Optimization via Apprenticeship Scheduling
This page was built for publication: Multiple-machine scheduling with learning effects and cooperative games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664951)
