Scheduling on parallel machines to minimise maximum lateness for the customer order problem
LH Su, PS Chen, SY Chen - International journal of systems …, 2013 - Taylor & Francis
LH Su, PS Chen, SY Chen
International journal of systems science, 2013•Taylor & FrancisThis article addresses the customer order problem where jobs are scheduled on a set of
parallel machines and dispatched in batches. A machine can process only one job at a time,
whereas multiple machines can simultaneously process jobs in a batch. The evaluation of
the performance is minimisation of maximum lateness. The problem is designated as. Three
heuristics, based on simple scheduling rules, for each problem are proposed and their tight
worst case bounds are found. Computational experiments are also conducted to evaluate …
parallel machines and dispatched in batches. A machine can process only one job at a time,
whereas multiple machines can simultaneously process jobs in a batch. The evaluation of
the performance is minimisation of maximum lateness. The problem is designated as. Three
heuristics, based on simple scheduling rules, for each problem are proposed and their tight
worst case bounds are found. Computational experiments are also conducted to evaluate …
This article addresses the customer order problem where jobs are scheduled on a set of parallel machines and dispatched in batches. A machine can process only one job at a time, whereas multiple machines can simultaneously process jobs in a batch. The evaluation of the performance is minimisation of maximum lateness. The problem is designated as . Three heuristics, based on simple scheduling rules, for each problem are proposed and their tight worst case bounds are found. Computational experiments are also conducted to evaluate the effectiveness of the heuristics.
Taylor & Francis OnlineShowing the best result for this search. See all results