Most classical scheduling research assumes that the objectives sought are common to all jobs to be scheduled. However, many real-life applications can be modeled by considering …
Scheduling problems are combinatorial optimization problems in which some activities have to be executed using resources that they need. A feasible allocation of the resources to the …
This paper formalizes and adapts the well-known concept of Pareto efficiency in the context of the popular robust optimization (RO) methodology for linear optimization problems. We …
Y Yin, Y Wang, TCE Cheng, DJ Wang… - Computers & Industrial …, 2016 - Elsevier
We consider integrated production and batch delivery scheduling in a make-to-order production system involving two competing agents, each of which having its own job set …
K Li, T Zhou, B Liu, H Li - Expert Systems with Applications, 2018 - Elsevier
This paper considers a shared scheduling environment for distributed manufacturing resources. In this paper, we proposed a multi-agent system based approach to promote …
We consider several two-agent scheduling problems with controllable job processing times, where agents A and B have to share either a single machine or two identical machines in …
We consider a multi-agent scheduling problem on a single machine in which each agent is responsible for his own set of jobs and wishes to minimize the total weighted completion …
SS Li, JJ Yuan - Journal of Scheduling, 2020 - Springer
We consider the competitive multi-agent scheduling problem on a single machine, where each agent's cost function is to minimize its total weighted late work. The aim is to find the …
D Wang, Y Yu, Y Yin, TCE Cheng - International Journal of …, 2021 - Taylor & Francis
We consider a multitasking scheduling model with multiple agents, each of which has a set of tasks to perform on a cloud manufacturing platform on a competitive basis. Each agent …