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

DOI10.1016/S0167-6377(97)00015-1MaRDI QIDQ1362528zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

dynamic programmingtotal completion timerelease timesunit-time open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

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

Cited in

(10)

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

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)