Using positioned completion times to solve a two-machine flowshop problem involving batching and scheduling
Conference
·
OSTI ID:36138
We address the problem of scheduling n jobs in a flow shop environment that consists of a batching machine with capacity c and a standard machine with capacity 1 such that total completion time is minimized. We formulate this problem as a pidgin integer programming problem by using the concept of position dependent completion times; to this formulation we apply Lagrangian relaxation to obtain a strong lower bound. We show that this lower bound dominates the bound that was obtained by Ahmadi et al. by applying Lagrangian relaxation to an ordinary formulation of this problem.
- OSTI ID:
- 36138
- Report Number(s):
- CONF-9408161-; TRN: 94:009753-0413
- Resource Relation:
- Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Approximation techniques for average completion time scheduling
Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem
An energy-aware multiobjective ant colony algorithm to minimize total completion time and energy cost on a single-machine preemptive scheduling
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:36138
+1 more
Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem
Journal Article
·
Tue May 15 00:00:00 EDT 2018
· Computational and Applied Mathematics
·
OSTI ID:36138
An energy-aware multiobjective ant colony algorithm to minimize total completion time and energy cost on a single-machine preemptive scheduling
Journal Article
·
Mon Dec 10 00:00:00 EST 2018
· Computers and Industrial Engineering
·
OSTI ID:36138