Job scheduling, cooperation, and control
From MaRDI portal
Publication:2583703
Recommendations
Cites work
- Cores of convex games
- Flow-shops with a dominant machine
- scientific article; zbMATH DE number 1929535 (Why is no real title available?)
- 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.
- Relaxed sequencing games have a nonempty core
- Sequencing and Cooperation
- Sequencing games
Cited in
(14)- Multiple-machine scheduling with learning effects and cooperative games
- Sequencing grey games
- Chinese postman games with multi-located players
- Open shop scheduling games
- Stability and fairness in the job scheduling problem
- Partitioning sequencing situations and games
- Subdivision-based digital geometry processing as a fundamental building block of digital manufacturing
- Sequencing and Cooperation
- The duality of jobs and machines in scheduling
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- Cooperative game theory based coordinated scheduling of two-machine flow-shop and transportation
- Proportionate flow shop games
- Sequencing games with repeated players
- Processing games with shared interest
This page was built for publication: Job scheduling, cooperation, and control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583703)