Minimizing the total completion time in a unit-time open shop with release times

DOI10.1016/S0167-6377(97)00015-1zbMATH Open0885.90062OpenAlexW2076906849WikidataQ127633500 ScholiaQ127633500MaRDI QIDQ1362528FDOQ1362528

Authors: Thomas Tautenhahn, Gerhard J. Woeginger 

Publication date: 5 August 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00015-1

Recommendations

• scientific article; zbMATH DE number 894721
• Total completion time minimization in two-machine job shops with unit-time operations
• Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
• Scheduling Unit-Time Open Shops with Deadlines

zbMATH Keywords

dynamic programmingtotal completion timerelease timesunit-time open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• On Edge Coloring Bipartite Graphs
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• A preemptive open shop scheduling problem with one resource
• Open shop problems with unit time operations
• Scheduling unit time open shops to minimize the weighted number of late jobs
• Scheduling Unit-Time Open Shops with Deadlines
• Note: Open-shop scheduling with release dates to minimize maximum lateness
• Title not available (Why is that?)

Cited In (10)

• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• Minimizing total completion time for UET tasks with release time and outtree precedence constraints
• A linear time approximation scheme for makespan minimization in an open shop with release dates
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
• The complexity of mean flow time scheduling problems with release times
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• On minimizing the weighted number of late jobs in unit execution time open-shops.
• Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
• Unit-time scheduling problems with time dependent resources

This page was built for publication: Minimizing the total completion time in a unit-time open shop with release times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362528)