Unit Execution Time Shop Problems

DOI10.1287/MOOR.7.1.57MaRDI QIDQ3965898zbMATH OpenOpenAlexFDO

Authors Teofilo F. Gonzalez

Publication date 1982

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.7.1.57

zbMATH Keywords

flow shopjob shopm machine open shopn independent jobsNP-complete problemsoptimal mean finishing timepreemptive and nonpreemptive schedules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(26)

• Minimizing total completion time in two-machine flow shops with exact delays
• On the complexity of preemptive open-shop scheduling problems
• Some no-wait shops scheduling problems: Complexity aspect
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• Two-machine shop scheduling with zero and unit processing times
• On the complexity of preemptive openshop scheduling problems
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• On minimizing the weighted number of late jobs in unit execution time open-shops.
• Complexity, bounds and dynamic programming algorithms for single track train scheduling
• A polynomial algorithm for an open shop problem with unit processing times and tree constraints
• A linear time approximation algorithm for movement minimization in conveyor flow shop processing
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
• The two-machine no-wait general and proportionate open shop makespan problem
• Some new results in flow shop scheduling
• Open shop problems with unit time operations
• Minimizing the weighted number of late jobs in UET open shops
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• Fitness landscape analysis for the no-wait flow-shop scheduling problem
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays
• Scheduling ordered open shops
• Reentrant open shop scheduling problem with time lags and no-wait constraints
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times
• Scheduling two-machine no-wait open shops to minimize makespan
• Minimizing the sojourn time of open shop scheduling problems with unit-time operations
• Using mixed graph coloring to minimize total completion time in job shop scheduling

This page was built for publication: Unit Execution Time Shop Problems

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