Scheduling involving setup times/costs plays an important role in today's modern
manufacturing and service environments for the delivery of reliable products on time. The …

Time-dependent routing amounts to design “best” routes in a graph in which arc traversal
times may vary over the planning horizon. In the last decade, a number of technological …

The Minimum Latency Problem (MLP) is a variant of the Traveling Salesman Problem which
aims to minimize the sum of arrival times at vertices. The problem arises in a number of …

The time dependent traveling salesman problem (TDTSP) is a generalization of the classical
traveling salesman problem (TSP), where arc costs depend on their position in the tour with …

We consider a flexible job shop scheduling problem with sequence-dependent setup times
that incorporates heterogeneous machine operator qualifications by taking account of …

The single machine total weighted tardiness problem with sequence-dependent setup times
(often known as problem) requires a given set of jobs to be sequenced on a single machine …

This paper deals with the single machine scheduling problem to minimize the total weighted
tardiness in the presence of sequence dependent setup. Firstly, a mathematical model is …

This paper considers a dual resource constrained scheduling problem prevalent in high-
capital cost manufacturing industry such as the photolithography area in the semiconductor …

This paper explores a problem related to both the Traveling Salesman Problem and
Scheduling Problem where a traveler moves through n locations (nodes), visits all locations …

This paper considers a single machine scheduling problem in which each job to be
scheduled belongs to a family and setups are required between jobs belonging to different …