A sequencing problem with family setup times
type: Item
instance of: scholarly article
title: A sequencing problem with family setup times
zbMATH Open document ID: 0854.68009
DOI: 10.1016/0166-218X(94)00139-5
author: Stanisław Zdrzałka
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 897411
zbMATH Keywords: single-machine scheduling problem
zbMATH Keywords: machine setup
MaRDI profile type: Publication
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: The one-machine sequencing problem
cites work: A block approach for single-machine scheduling with release dates and due dates
cites work: Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
cites work: PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
cites work: Minimizing maximum lateness on one machine: computational experience and some applications
cites work: Q4124328
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS
cites work: Q3989986
cites work: An algorithm for single machine sequencing with release dates to minimize maximum cost
cites work: Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
cites work: Preemptive scheduling with release dates, delivery times and sequence independent setup times
full work available at URL: 0166-218x(94)00139-5
OpenAlex ID: W2162833856
description: scientific article; zbMATH DE number 897411