A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
- 16 November 2007
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 183 (1), 74-86
- https://doi.org/10.1016/j.ejor.2006.09.087
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Supply Chain Scheduling: Batching and DeliveryOperations Research, 2003
- Scheduling with batching: A reviewEuropean Journal of Operational Research, 2000
- A review of scheduling research involving setup considerationsOmega, 1999
- Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion timeAnnals of Operations Research, 1998
- Single machine scheduling with batch deliveriesEuropean Journal of Operational Research, 1996
- One-machine batching and sequencing of multiple-type itemsComputers & Operations Research, 1994
- The complexity of one-machine batching problemsDiscrete Applied Mathematics, 1993
- Minimizing flow time on a single machine with job classes and setup timesNaval Research Logistics (NRL), 1991
- Batch sizing and job sequencing on a single machineAnnals of Operations Research, 1990
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979