Unknown

Dataset Information

0

Single-machine scheduling to minimize total completion time and tardiness with two competing agents.


ABSTRACT: We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.

SUBMITTER: Lee WC 

PROVIDER: S-EPMC3915531 | biostudies-other | 2014

REPOSITORIES: biostudies-other

Similar Datasets

| S-EPMC4167446 | biostudies-other
| S-EPMC8929393 | biostudies-literature
| S-EPMC3950368 | biostudies-other
| S-EPMC6129193 | biostudies-literature
| S-EPMC5540412 | biostudies-other
| S-EPMC4132401 | biostudies-other
| PRJNA515831 | ENA
| S-EPMC3942401 | biostudies-other
| S-EPMC4407535 | biostudies-literature
| S-EPMC4764368 | biostudies-literature