Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602)

scientific article; zbMATH DE number 6889138

Language	Label	Description	Also known as
English	Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs	scientific article; zbMATH DE number 6889138

Statements

instance of

scholarly article

0 references

title

Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (English)

0 references

0 references

0 references

0 references

Arabian Journal for Science and Engineering

0 references

publication date

14 June 2018

0 references

zbMATH Keywords

multi-agent scheduling

0 references

JIT jobs

0 references

proportionate flow shop

0 references

FPTAS

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s13369-017-2900-9

0 references

cites work

Review of the ordered and proportionate flow shop scheduling research

0 references

The just-in-time scheduling problem in a flow-shop scheduling system

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time

0 references

A competitive scheduling problem and its relevance to UMTS channel assignment

0 references

Rescheduling for New Orders

0 references

A multiple-criterion model for machine scheduling

0 references

Scheduling Problems with Two Competing Agents

0 references

A note on the complexity of the problem of two-agent scheduling on a single machine

0 references

Competitive Two-Agent Scheduling and Its Applications

0 references

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

0 references

Approximation schemes for two-machine flow shop scheduling with two agents

0 references

Unbounded parallel-batching scheduling with two competitive agents

0 references

Bounded parallel-batching scheduling with two competing agents

0 references

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

0 references

Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities

0 references

Two-agent single-machine scheduling problem with just-in-time jobs

0 references

Two-agent scheduling with agent specific batches on an unbounded serial batching machine

0 references

Scheduling two job families on a single machine with two competitive agents

0 references

Two-agent scheduling in a flowshop

0 references

Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

0 references

Multi-agent single machine scheduling

0 references

Multi-agent scheduling on a single machine with max-form criteria

0 references

Approximation algorithms for multi-agent scheduling to minimize total weighted completion time

0 references

Single-machine multi-agent scheduling problems with a global objective function

0 references

Multiagent Scheduling

0 references

A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems

0 references

Single machine scheduling to minimize the number of early and tardy jobs

0 references

Q4198056

0 references

Minimizing total weighted completion time in a proportionate flow shop

0 references

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

0 references

Identifiers

zbMATH Open document ID

1390.90319

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

10.1007/S13369-017-2900-9

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1640602