This paper investigates scheduling problems with simultaneous considerations of deterioration effects and deteriorating multi-maintenance activities on unrelated parallel machines. We examine two models of scheduling with the deterioration effect, namely the job-dependent and position-dependent deterioration model and the time-dependent deterioration model. We assume that each machine may be su...

To date, the topic of unrelated parallel machine scheduling problems with machine-dependent and job sequence-dependent setup times has received relatively little research attention. In this study, a hybrid artificial bee colony (HABC) algorithm is presented to solve this problem with the objective of minimizing the makespan. The performance of the proposed HABC algorithmwas evaluated by compari...

Abst rac t There is an increasing need for document search mechanisms capable of matching a natural language query with documents written in a different language. Recently, we conducted several experiments aimed at comparing various methods of incorporating a cross-linguistic capability to existing information retrieval (IR) systems. Our results indicate that translating queries with off-theshe...

Setup operations on machines usually need of tooling and/or personnel to be carried out. Therefore, the length of the setup might not only depend on the machine and job sequence, but also on the number of resources assigned. This situation is common in real problems arising in several industries where setup operations in production lines are frequent. These operations are indeed setups whose le...

We study an unrelated parallel machines scheduling problem with sequence and machine dependent setup times. A logicbased Benders decomposition approach is proposed to minimize the makespan. This approach is a hybrid model that makes use of a mixed integer programming master problem and a specialized solver for travelling salesman subproblems. The master problem is used to assign jobs to machine...

This paper addresses a single-stage scheduling problem with outsourcing allowed where each job can be either scheduled for in-house production or outsourced to one of the outside subcontractors available. The manufacturer has an unrelated parallel machine system, and each subcontractor has its own single machine. Subcontractors are capable to process all the jobs. Unlike most of past research, ...

In this paper we propose an improved formulation for an unrelated parallel machine problem with machine and job sequence-dependent setup times that outperforms the previously published formulations regarding size of instances and CPU time to reach optimal solutions. The main difference between the proposed formulation and previous ones is the way the makespan has been linearized. It provides im...