Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

DOI10.1006/JAGM.1993.1002MaRDI QIDQ4033755zbMATH OpenOpenAlexFDO

Authors Jian-Zhong Du, Joseph Y.-T. Leung

Publication date 16 May 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1993.1002

zbMATH Keywords

fixed completion timeflow shopjob preemptionmean job completion timeNP-hardnessopen shoppolynomial algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
• On the complexity of preemptive open-shop scheduling problems
• The complexity of shop-scheduling problems with two or three jobs
• A Note On The Complexity Of Openshop Scheduling Problems
• Two-machine flow-shop scheduling problems with minimizing the total completion times

Cited in

(27)

• On the complexity of preemptive open-shop scheduling problems
• The complexity of shop-scheduling problems with two or three jobs
• The two-machine total completion time flow shop problem
• Two-machine shop scheduling with zero and unit processing times
• On the complexity of preemptive openshop scheduling problems
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Scheduling two-machine preemptive open shops to minimize total completion time
• Complexity of mixed shop scheduling problems: A survey
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• scientific article; zbMATH DE number 4131935 (Why is no real title available?)
• Integrality Property in Preemptive Parallel Machine Scheduling
• Some properties of the total flow-time problem of two machine open-shop
• scientific article; zbMATH DE number 4074798 (Why is no real title available?)
• The open shop scheduling problem with a given sequence of jobs on one machine
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity
• Two-machine flow-shop scheduling problems with minimizing the total completion times
• Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
• Bounding the running time of algorithms for scheduling and packing problems
• On the complexity of open shop scheduling with time lags
• Properties of optimal schedules in preemptive shop scheduling
• On the open-shop problem with preemption and minimizing the average completion time
• Open shops with jobs overlap -- revisited
• The bipartite margin shop and maximum red matchings free of blue-red alternating cycles
• The complexity of mean flow time scheduling problems with release times
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms

This page was built for publication: Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

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