Scheduling in Kanban-Controlled Flowshops to Minimise the Makespan of Containers

被引：0

|

作者：

G.V. Ramanan

C. Rajendran

机构：

[1] Industrial Management Division,

[2] Department of Humanities and Social Sciences,undefined

[3] Indian Institute of Technology Madras,undefined

[4] Chennai-600 036,undefined

[5] India,undefined

来源：

The International Journal of Advanced Manufacturing Technology | 2003年 / 21卷

关键词：

Key words: Kanban; Makespan; Scheduling;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：348 / 354

页数：6

相关论文

共 45 条

[41] A hybrid two-stage algorithm for solving the blocking flow shop scheduling problem with the objective of minimise the makespan
Kumar, Harendra
Giri, Shailendra
INTERNATIONAL JOURNAL OF APPLIED MANAGEMENT SCIENCE, 2022, 14 (04) : 316 - 335
[42] Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance
Chandrasekaran, S.
Ponnambalam, S. G.
Suresh, R. K.
Vijayakumar, N.
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 4012 - +
[43] Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers
Rajendran, C
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1999, 37 (05) : 1137 - 1158
[44] No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates
Ben Chihaoui, Faten
Kacem, Imed
Hadj-Alouane, Atidel B.
Dridi, Najoua
Rezg, Nidhal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (21) : 6273 - 6286
[45] Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions
Liu, Lei
Urgo, Marcello
ANNALS OF OPERATIONS RESEARCH, 2024, 338 (01) : 741 - 764

← 1 2 3 4 5 →