Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives

DOI10.1007/S10479-017-2515-2MaRDI QIDQ1730482zbMATH OpenOpenAlexFDO

Authors Shesh Narayan Sahu, Yuvraj Gajpal, Swapan Debbarma

Publication date 6 March 2019

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-017-2515-2

zbMATH Keywords

combinatorial optimizationheuristicparticle swarm optimizationschedulingcompeting agents

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Applications of game theory (91A80)

Recommendations

• Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
• scientific article; zbMATH DE number 6531341
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• Two-agent single machine scheduling problem with the total weighted early work
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop

Cites work

• A Lagrangian approach to single-machine scheduling problems with two competing agents
• A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing
• A discrete version of particle swarm optimization for flowshop scheduling problems
• A multiple-criterion model for machine scheduling
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• A survey of scheduling problems with setup times or costs
• A two-agent single-machine scheduling problem with late work criteria
• A two-machine flowshop problem with two agents
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• Competitive two-agent scheduling and its applications
• Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
• Multi-agent single machine scheduling
• Scheduling Problems with Two Competing Agents
• Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness
• Scheduling two agents with controllable processing times
• Single machine batch scheduling with two competing agents to minimize total flowtime
• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
• Solving a two-agent single-machine scheduling problem considering learning effect
• Two-agent scheduling on uniform parallel machines with min-max criteria
• Unbounded parallel-batching scheduling with two competitive agents
• \(CON/SLK\) due date assignment and scheduling on a single machine with two agents

Cited in

(1)

• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop

This page was built for publication: Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives

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