scientific article; zbMATH DE number 2221456
From MaRDI portal
Publication:5702308
zbMath1079.90539MaRDI QIDQ5702308
Haibing Li, Joseph Y.-T. Leung, Michael L. Pinedo
Publication date: 1 November 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (12)
Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines ⋮ Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems ⋮ Prioritized customer order scheduling to maximize throughput ⋮ New approximate algorithms for the customer order scheduling problem with total completion time objective ⋮ A note on the complexity of the concurrent open shop problem ⋮ Integrated production and transportation scheduling with order-dependent inventory holding costs ⋮ An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems ⋮ Approximating Weighted Completion Time for Order Scheduling with Setup Times ⋮ Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time ⋮ Tailoring customer order scheduling search algorithms ⋮ Parallel machine scheduling with job assignment restrictions
This page was built for publication:
