4.7 Article

Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Management

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

Ruben Ruiz et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)

Article Engineering, Industrial

A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness

JM Framinan et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2006)

Article Management

A comprehensive review and evaluation of permutation flowshop heuristics

R Ruiz et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2005)

Review Engineering, Industrial

Flowshop-scheduling problems with makespan criterion: a review

SR Hejazi et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2005)

Article Engineering, Industrial

Scheduling in flowshops to minimize total tardiness of jobs

S Hasija et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2004)

Article Operations Research & Management Science

Approximative procedures for no-wait job shop scheduling

CJ Schuster et al.

OPERATIONS RESEARCH LETTERS (2003)

Review Management

Variable neighborhood search: Principles and applications

P Hansen et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)