scientific article; zbMATH DE number 7109369

DOI10.15960/J.CNKI.ISSN.1007-6093.2018.03.011MaRDI QIDQ5197262zbMATH OpenFDO

Authors Cheng He, Xinxin Han

Publication date 20 September 2019

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2018.03.011

zbMATH Keywords

batching machinecomputational complexitymaximum costPareto optimal solutionstwo-agent scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29)

Recommendations

• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• Two-agent scheduling on an unbounded serial batching machine
• Scheduling two agents on uniform parallel machines with~makespan and cost functions
• Two-agent scheduling on uniform parallel machines with min-max criteria
• Serial-batching scheduling with two agents to minimize makespan and maximum cost
• Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
• Improved algorithms for two-agent scheduling on an unbounded serial-batching machine

Cited in

(20)

• Two-agent scheduling to minimize the maximum cost with position-dependent jobs
• Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
• A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
• A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
• Single machine batch scheduling with two non-disjoint agents and splitable jobs
• Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
• Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost
• Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
• Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
• Serial-batching scheduling with two agents to minimize makespan and maximum cost
• Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
• Scheduling two agents on uniform parallel machines with~makespan and cost functions
• Unbounded parallel-batching scheduling with two competitive agents
• Bounded parallel-batching scheduling with two competing agents
• Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
• Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
• Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
• Two-agent scheduling on uniform parallel machines with min-max criteria
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine

This page was built for publication:

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