Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
From MaRDI portal
Publication:1640602
DOI10.1007/S13369-017-2900-9zbMATH Open1390.90319OpenAlexW2766676815MaRDI QIDQ1640602FDOQ1640602
Authors: Shisheng Li, Ren-Xia Chen, Wenjie Li 
Publication date: 14 June 2018
Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13369-017-2900-9
Recommendations
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- The just-in-time scheduling problem in a flow-shop scheduling system
- Two-agent scheduling in a flowshop
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Competitive two-agent scheduling and its applications
- Scheduling Problems with Two Competing Agents
- Multiagent scheduling. Models and algorithms
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Review of the ordered and proportionate flow shop scheduling research
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- Two-agent single-machine scheduling problem with just-in-time jobs
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Scheduling two job families on a single machine with two competitive agents
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Single-machine multi-agent scheduling problems with a global objective function
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Two-agent scheduling in a flowshop
- Rescheduling for New Orders
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Single machine scheduling to minimize the number of early and tardy jobs
- Approximation schemes for two-machine flow shop scheduling with two agents
- Minimizing total weighted completion time in a proportionate flow shop
- The just-in-time scheduling problem in a flow-shop scheduling system
- Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
Cited In (3)
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Single-machine scheduling with multi-agents to minimize total weighted late work
This page was built for publication: Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640602)
