Now showing items 1-10 of 68
Split scheduling with uniform setup times
We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the ...
Job satisfaction and discrepancies between social and biological timing
(TAYLOR & FRANCIS LTDABINGDON, 2013-08-02)
The discrepancies between social and biological timing are reflected in shift workers' well-being. The aim of this study was to verify the association between job satisfaction and chronotype among day and night nursing ...
Splitting versus setup trade-offs for scheduling to minimize weighted completion time
We study scheduling problems when jobs can be split and a setup is required before processing each part, to minimize the weighted sum of completion times. Using a simple splitting strategy and a reduction to an orders ...
Controle de transitórios em escalonamento de job shop cíclico
(Sociedade Brasileira de Automática, 2002)
Applying MILP/Heuristic algorithms to automated job-shop scheduling problems in aircraft-part manufacturing
(Universidad Nacional de Santa Catarina, 2013-12)
This work presents efficient algorithms based on Mixed-Integer Linear Programming (MILP) and heuristic strategies for complex job-shop scheduling problems raised in Automated Manufacturing Systems. The aim of this work is ...
Applying MILP/Heuristic Algorithms to Automated Job-Shop Scheduling Problems in Aircraft-Part Manufacturing
(Revista iberoamericana de ingeniería industrial, 2014-04)
This work presents efficient algorithms based on Mixed-Integer LinearProgramming (MILP) and heuristic strategies for complex job-shop scheduling problemsraised in Automated Manufacturing Systems. The aim of this work is ...
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
We study a natural generalization of the problem of minimizing makespan on unrelated machines in which jobs may be split into parts. The different parts of a job can be (simultaneously) processed on different machines, ...
Heuristic methods for the single machine scheduling problem with different ready times and a common due date
(TAYLOR & FRANCIS LTDABINGDON, 2012)
The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness ...
Programação de operações com restrições disjuntivasScheduling with disjunctive constraints
(Universidade Federal de São Carlos, 1996)