Batch scheduling problem with due-date and fuzzy precedence relation

Title:

Batch scheduling problem with due-date and fuzzy precedence relation

Creator:

Li, Xuesong, Ishii, Hiroaki, and Chen, Minghao

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:a144c11e-5e3b-4e08-965d-9ef10b154638
uuid:a144c11e-5e3b-4e08-965d-9ef10b154638

Subject:

single-machine, batch scheduling, modified due-date, fuzzy precedence relation, and non-dominated batch sequence

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy precedence. However, there usually exists no batch sequence optimizing both objectives at a time. Therefore, we seek some non-dominated batch sequences after the definition of non-dominated batch sequence. Based on an iterative Procedure HL proposed by Cheng et al., an efficient algorithm is presented to find some non-dominated batch sequences.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

[346]-356

Source:

Kybernetika | 2012 Volume:48 | Number:2

Harvested from:

CDK

Metadata only:

false