Improved dynamic programs for some batching problems involving the maximum lateness criterion
type: Item
instance of: scholarly article
title: Improved dynamic programs for some batching problems involving the maximum lateness criterion
zbMATH Open document ID: 0969.90049
DOI: 10.1016/S0167-6377(00)00040-7
author: A. E. Gerodimos
author: Albert P. M. Wagelmans
published in: Operations Research Letters
publication date: 2001-10-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1556846
zbMATH Keywords: batching
zbMATH Keywords: scheduling
zbMATH Keywords: dynamic programming
zbMATH Keywords: computational complexity
zbMATH Keywords: lateness
MaRDI profile type: Publication
cites work: Improved Algorithms for Economic Lot Size Problems
cites work: Q4065051
cites work: The complexity of one-machine batching problems
cites work: Q4859840
cites work: Scheduling a batching machine
cites work: Batch sizing and job sequencing on a single machine
cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
cites work: Scheduling the production of two-component jobs on a single machine
cites work: Scheduling with batching: A review
cites work: Batching in single operation manufacturing systems
cites work: Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
cites work: Scheduling Groups of Jobs on a Single Machine
Wikidata QID: Q127613622
description: scientific article; zbMATH DE number 1556846