scientific article; zbMATH DE number 1271325

DOI10.1002/(SICI)1520-6750(199902)46:1%3C57::AID-NAV4%3E3.0.CO;2-HMaRDI QIDQ4238573zbMATH OpenFDO

Authors Chung-Yee Lee, Jianer Chen

Publication date 4 October 1999

Full work available at URL https://doi.org/10.1002/(SICI)1520-6750(199902)46:1%3C57::AID-NAV4%3E3.0.CO;2-H

zbMATH Keywords

completion time of all jobsheuristicone-job-on-multiple-machine modelpseudopolynomial algorithmtwo-machine problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent multiprocessor tasks
• scientific article; zbMATH DE number 2185607
• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
• Scheduling independent multiprocessor tasks

Cited in

(27)

• Scheduling of a single crane in batch annealing process
• Deterministic multiprocessor scheduling with multiple objectives
• Approximation algorithms for general parallel task scheduling
• Graph multi-coloring for a job scheduling application
• Shared multi-processor scheduling
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
• The consecutive multiprocessor job scheduling problem
• Shared processor scheduling of multiprocessor jobs
• A class of generalized multiprocessor scheduling problems
• A polynomial algorithm for multiprocessor scheduling with two job lengths.
• Multitasking via alternate and shared processing: algorithms and complexity
• A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• scientific article; zbMATH DE number 176000 (Why is no real title available?)
• An effective approximation algorithm for the malleable parallel task scheduling problem
• scientific article; zbMATH DE number 1416512 (Why is no real title available?)
• Heterogeneous Multi-resource Allocation with Subset Demand Requests
• A job-shop problem with one additional resource type
• Multitasking scheduling with shared processing
• The price of anarchy for a berth allocation game
• A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines
• A Lagrangian heuristic for satellite range scheduling with resource constraints
• Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions
• Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
• Mass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic service
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

This page was built for publication:

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