Exact algorithms for inventory constrained scheduling on a single machine

Authors:
Dirk Briskorn;Florian Jaehn;Erwin Pesch
Affiliations:
Lehrstuhl für Quantitative Planung, Universität Siegen, Siegen, Germany 57068;Lehrstuhl für Wirtschaftsinformatik, Universität Siegen, Siegen, Germany 57068;Lehrstuhl für Wirtschaftsinformatik, Universität Siegen, Siegen, Germany 57068
Venue:
Journal of Scheduling
Year:
2013

Citing 5
Cited 2

Minimizing makespan in two-stage hybrid cross docking scheduling problem

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Scheduling a maintenance activity and due-window assignment on a single machine

Computers and Operations Research
Truck scheduling at zero-inventory cross docking terminals

Computers and Operations Research
The parcel hub scheduling problem: A simulation-based solution approach

Computers and Industrial Engineering

Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times

Journal of Scheduling
Approximation schemes for single machine scheduling with non-renewable resource constraints

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on single machine scheduling subject to inventory constraints. Jobs add or remove items to or from the inventory, respectively. Jobs that remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a single machine where the objective is to minimize the total weighted completion time. We develop properties of optimal solutions and design a branch and bound algorithm and a dynamic programming algorithm with two extensions. We compare the approaches in our computational study and empirically derive parameter settings leading to instances which are hard to solve.