Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
type: Item
instance of: scholarly article
title: Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
zbMATH Open document ID: 1390.90319
author: Shisheng Li
author: Ren-Xia Chen
author: Wenjie Li
published in: Arabian Journal for Science and Engineering
publication date: 2018-06-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6889138
zbMATH Keywords: multi-agent scheduling
zbMATH Keywords: JIT jobs
zbMATH Keywords: proportionate flow shop
zbMATH Keywords: FPTAS
MaRDI profile type: Publication
full work available at URL: s13369-017-2900-9
OpenAlex ID: W2766676815
cites work: Review of the ordered and proportionate flow shop scheduling research
cites work: The just-in-time scheduling problem in a flow-shop scheduling system
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
cites work: A competitive scheduling problem and its relevance to UMTS channel assignment
cites work: Rescheduling for New Orders
cites work: A multiple-criterion model for machine scheduling
cites work: Scheduling Problems with Two Competing Agents
cites work: A note on the complexity of the problem of two-agent scheduling on a single machine
cites work: Competitive Two-Agent Scheduling and Its Applications
cites work: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
cites work: Approximation schemes for two-machine flow shop scheduling with two agents
cites work: Unbounded parallel-batching scheduling with two competitive agents
cites work: Bounded parallel-batching scheduling with two competing agents
cites work: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
cites work: Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
cites work: Two-agent single-machine scheduling problem with just-in-time jobs
cites work: Two-agent scheduling with agent specific batches on an unbounded serial batching machine
cites work: Scheduling two job families on a single machine with two competitive agents
cites work: Two-agent scheduling in a flowshop
cites work: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
cites work: Multi-agent single machine scheduling
cites work: Multi-agent scheduling on a single machine with max-form criteria
cites work: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
cites work: Single-machine multi-agent scheduling problems with a global objective function
cites work: Multiagent Scheduling
cites work: A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
cites work: Single machine scheduling to minimize the number of early and tardy jobs
cites work: Q4198056
cites work: Minimizing total weighted completion time in a proportionate flow shop
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
DOI: 10.1007/S13369-017-2900-9
description: scientific article; zbMATH DE number 6889138