scientific article; zbMATH DE number 4162635

MaRDI QIDQ3489778zbMATH OpenFDO

Authors Minoru Tada, Toshio Nishida, Hiroaki Ishii

Publication date 1990

zbMATH Keywords

maximum latenessbi-criteria schedulingmaximum completion timeuniform processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Bicriterion scheduling of identical processing time jobs by uniform processors
• On the complexity of bi-criteria scheduling on a single batch processing machine
• Bi-criteria scheduling on a single parallel-batch machine
• Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
• Bicriteria scheduling of equal length jobs on uniform parallel machines
• Uniform processor scheduling problem with nonsimultaneous available time
• Bicriterion scheduling with equal processing times on a batch processing machine
• Approximation Algorithms For Scheduling On Uniform Processors
• Equal processing time bicriteria scheduling on parallel machines
• On a special case of uniform processor scheduling

Cited in

(5)

• An improved lower bound for a bi-criteria scheduling problem
• Bicriteria scheduling with double due dates to minimize the maximum lateness
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• Two machine open shop scheduling problems with bi-criteria
• Faster algorithms for bicriteria scheduling of identical jobs on uniform machines

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 Q3489778)