Journal ArticleDOI
Minimizing maximum tardiness for unrelated parallel machines
V. Suresh,Dipak Chaudhuri +1 more
Reads0
Chats0
TLDR
In this article, the scheduling of n jobs, all requiring a single stage of processing, on m unrelated parallel machines is considered, and the scheduling objective is to minimize the maximum tradiness.Citations
More filters
Journal ArticleDOI
Product grouping for batch processes
Philip C. Jones,Robert R. Inman +1 more
TL;DR: In this paper, the authors consider a production environment in which multiple products produced in a batch process share several facilities, and the products must be grouped or assigned to facilities so as to minimize associated inventory carrying costs (an NP-hard problem).
Journal ArticleDOI
Unrelated parallel machines scheduling with dependent setup times in textile industry
TL;DR: In this paper , an unrelated parallel machines scheduling problem with machine and sequence dependent setup times, machine eligibility and different resource types constraints is tackled, inspired from a textile industry partner case.
Proceedings ArticleDOI
Testing multiple threads Tabu search by solving scheduling problems
Shuo-Cheng Sun,Yi-Feng Hung +1 more
TL;DR: A problem of scheduling, which minimizes the total tardiness of a set of jobs to be scheduled on parallel identical machines, is presented as an example and the results of single thread and multithreads are discussed.
Proceedings ArticleDOI
A Branch-and-Bound to solve the scheduling problem Pm/r j /ΣT j
TL;DR: In this article, the authors presented the first study for the total tardiness minimization on parallel machine scheduling problem with different release dates of jobs, without any preemption or splitting, on identical parallel machine.
Posted Content
Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey.
TL;DR: In this paper, an extensive literature review on the application of heuristic and metaheuristic methods for solving the unrelated parallel machines scheduling problem (UPMSP) is provided. But no study has until now tried to systematise the research in which heuristic methods are applied for the UPMSP.
References
More filters
Book
Introduction to sequencing and scheduling
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Book
Theory of scheduling
TL;DR: Reading theory of scheduling as one of the reading material to finish quickly to increase the knowledge and happiness in your lonely time.
Journal ArticleDOI
Scheduling with Deadlines and Loss Functions
TL;DR: The problem of this paper is that of scheduling several one-stage tasks on several processors, which are capable of handling the tasks with varying degrees of efficiency, to minimize the total loss, which is a sum of losses associated with the individual tasks.
Journal ArticleDOI
Survey of scheduling research involving due date determination decisions
T.C.E. Cheng,Mahesh Gupta +1 more
TL;DR: A critical review of a particular segment of scheduling research in which the due to date assignment decision is of primary interest is presented, observing that while the static single- machine problem with constant or common due dates has been well researched, very little or no work has been done on the dynamic multi-machine problem with sophisticated due date assignment methods.
Journal ArticleDOI
Efficient algorithms for scheduling semiconductor burn-in operations
TL;DR: In this article, the problem of scheduling semiconductor burn-in operations is modeled as batch processing machines, where the processing time of a batch is equal to the largest processing time among all jobs in the batch.