Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
Copyright policy )Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
The author considers the problem of minimizing maximum delivery time on a single machine under the assumption that the set of \(n\) jobs is partitioned into batches and a unit set-up time is associated with every switching from a job in one batch to a job in another batch. The problem is known to be NP-hard [see \textit{J. Bruno} and \textit{P. Downey}, SIAM J. Computing 7, 393-403 (1978; Zbl 0386.68050)]. Here, three polynomial-time approximation algorithms are presented and their worst-case behavior is analyzed.
worst-case behavior, Deterministic scheduling theory in operations research, single machine, unit set-up time, maximum delivery time, NP-hard, polynomial-time approximation algorithms
worst-case behavior, Deterministic scheduling theory in operations research, single machine, unit set-up time, maximum delivery time, NP-hard, polynomial-time approximation algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).13 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!