A sequencing problem with family setup times

DOI10.1016/0166-218X(94)00139-5zbMath0854.68009OpenAlexW2162833856MaRDI QIDQ1917311

Stanisław Zdrzałka

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00139-5

zbMATH Keywords

single-machine scheduling problemmachine setup

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Single-machine scheduling with advanced process control constraints ⋮ Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines

Cites Work

• Unnamed Item
• Unnamed Item
• A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
• A block approach for single-machine scheduling with release dates and due dates
• An algorithm for single machine sequencing with release dates to minimize maximum cost
• The one-machine sequencing problem
• Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
• Preemptive scheduling with release dates, delivery times and sequence independent setup times
• OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Minimizing maximum lateness on one machine: computational experience and some applications
• On the Complexity of Scheduling with Batch Setup Times

This page was built for publication: A sequencing problem with family setup times