Weighted-tardiness scheduling on parallel machines with proportional weights
Operations Research
A backward approach in list scheduling algorithms for multi-machine tardiness problems
Computers and Operations Research
Scheduling parallel machines to minimize total weighted and unweighted tardiness
Computers and Operations Research
Parallel machine scheduling with splitting jobs
Discrete Applied Mathematics
Scheduling unrelated parallel machines to minimize total weighted tardiness
Computers and Operations Research
Scheduling Parallel Machines for the Customer Order Problem
Journal of Scheduling
Planning production using mathematical programming: The case of a woodturning company
Computers and Operations Research
Online splitting interval scheduling on m identical machines
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
A multiobjective optimization approach to solve a parallel machines scheduling problem
Advances in Artificial Intelligence
Two branch-and-bound algorithms for the robust parallel machine scheduling problem
Computers and Operations Research
Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates
International Journal of Applied Evolutionary Computation
Computers and Industrial Engineering
Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
Computers and Operations Research
Hi-index | 0.01 |
We focus on the problem of scheduling n independent jobs on m identical parallel machines with the objective of minimizing total tardiness of the jobs considering a job splitting property. In this problem, it is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. We develop several dominance properties and lower bounds for the problem, and suggest a branch and bound algorithm using them. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithm solves problems of moderate sizes in a reasonable amount of computation time. Scope and purpose In this paper, we consider an operations scheduling problem in a real manufacturing system that produces printed circuit boards (PCBs). In the PCB manufacturing system, production orders are specified by the product types, production quantities and due dates. In a bottleneck workstation of the manufacturing system, in which there are multiple parallel machines, a job required for a production order can be split into basic processing units, each of which can be processed on a machine. We present an algorithm that can give an optimal schedule for a scheduling problem in the workstation for the objective of minimizing total tardiness of production orders. Since meeting due dates of customers' orders become more and more important for the survival of a manufacturing company in highly competitive market environments of these days, the algorithm may provide the company with a competitive edge in the industry.