The problem undertaken in this study is inspired from a real life application. Consider a vehicle routing problem where the distances between the customer locations are either one or two. We name this problem as VRP12 in an analogy for the name TSP12 used for the traveling salesman problem in...

We consider coordination mechanisms for the distributed scheduling of n jobs on m parallel machines, where each agent holding a job selects a machine to process his/her own job. Without a central authority to construct a schedule, each agent acts selfishly to minimize his/her own disutility,...

A multi-chip package (MCP) consists of several chip modules in a single package. We consider a scheduling problem for assembling MCPs. In order to assemble an MCP, a lot should repeat assembly process stages such as die attach and wire bonding as many as the number of chips to be assembled. The...

In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a...

This paper is concerned with scheduling a number of jobs on multiple identical parallel machines to minimise job Completion Time Variance (CTV), which is a performance measure that emphasises providing uniform service to jobs. CTV minimisation is closely related to common due date problems,...

This paper is concerned with scheduling a number of jobs on multiple identical parallel machines to minimise job Completion Time Variance (CTV), which is a performance measure that emphasises providing uniform service to jobs. CTV minimisation is closely related to common due date problems,...