Job shop scheduling problem with competing agents

DOI10.1016/J.JCSS.2026.103842MaRDI QIDQ7404693zbMATH OpenFDO

Authors Abdenour Azerine, Mourad Boudhar, Djamal Rebaine

Publication date 2027

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2026.103842

zbMATH Keywords

branch and boundcomplexityheuristic and meta-heuristicjob shopmathematical programmingmulti-agents

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A survey of job shop scheduling problem: the types and models
• A two-machine no-wait flow shop problem with two competing agents
• An Algorithm for Solving the Job-Shop Problem
• Approximation schemes for two-machine flow shop scheduling with two agents
• scientific article; zbMATH DE number 3908167 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Mixed integer programming models for job shop scheduling: A computational analysis
• Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
• Scheduling Problems with Two Competing Agents
• Scheduling. Theory, algorithms, and systems.
• Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
• Two-agent scheduling in a flowshop
• Two-agent scheduling in a two-machine open shop

This page was built for publication: Job shop scheduling problem with competing agents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7404693)