A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times

DOI10.1016/J.APM.2014.10.044MaRDI QIDQ2009966zbMATH OpenOpenAlexFDO

Authors Yunqiang Yin, Wen-Hung Wu, Chin-Chia Wu, Wen-Hsiang Wu, T. C. Edwin Cheng

Publication date 3 December 2019

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2014.10.044

zbMATH Keywords

MBO algorithmschedulingtwo agents

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
• Competitive two-agent scheduling with learning effect and release times on a single machine
• Competitive two-agent scheduling and its applications
• Competitive two-agent scheduling with release dates and preemption on a single machine

Cites work

• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
• A comparative study of artificial bee colony algorithm
• A dual algorithm for the one-machine scheduling problem
• A Lagrangian approach to single-machine scheduling problems with two competing agents
• A multi-agent model describing self-renewal of differentiation effects on the blood cell population
• A multiple-criterion model for machine scheduling
• A note on the complexity of the problem of two-agent scheduling on a single machine
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Competitive two-agent scheduling and its applications
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Scheduling Problems with Two Competing Agents
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Scheduling two agents with controllable processing times
• Simulating forest plantation co-management with a multi-agent system
• The single-machine total tardiness problem with unequal release times and a linear deterioration
• The two-machine total completion time flow shop problem
• Two-agent scheduling to minimize the total cost
• Two-agent scheduling with position-based deteriorating jobs and learning effects
• Using artificial bees to solve partitioning and scheduling problems in codesign

Cited in

(3)

• A survey of due-date related single-machine with two-agent scheduling problem
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain

This page was built for publication: A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times

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