DOI10.1111/j.1467-9574.1990.tb01276.xzbMath0716.90053OpenAlexW2140061871MaRDI QIDQ3204310
No author found.
Publication date: 1990
Published in: Statistica Neerlandica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-9574.1990.tb01276.x
Minimizing the weighted number of tardy jobs on multiple machines: a review,
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems,
Pareto-scheduling of two competing agents with their own equal processing times,
Scheduling identical jobs on uniform parallel machines under position-based learning effects,
Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms,
Acquisition planning and scheduling of computing resources,
Uniform machine scheduling of unit-time jobs subject to resource constraints,
On minimizing the weighted number of late jobs in unit execution time open-shops.,
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity,
Preemptive scheduling of equal-length jobs in polynomial time,
Scheduling on uniform machines with a conflict graph: complexity and resolution,
Faster algorithms for bicriteria scheduling of identical jobs on uniform machines,
Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines,
Parallel machine problems with equal processing times: a survey,
Scheduling two agents on uniform parallel machines with~makespan and cost functions,
Open shop scheduling problems with late work criteria.,
A scheduling problem with job values given as a power function of their completion times,
Scheduling identical jobs on uniform machines with a conflict graph,
Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers,
Ideal schedules in parallel machine settings,
Fast LP models and algorithms for identical jobs on uniform parallel machines,
Two-agent scheduling on uniform parallel machines with min-max criteria,
Bicriterion scheduling of identical processing time jobs by uniform processors,
Bicriteria scheduling of equal length jobs on uniform parallel machines,
Single machine scheduling with batch deliveries,
Parallel machine batching and scheduling with deadlines,
Scheduling equal-length jobs on identical parallel machines,
Multicriteria scheduling,
Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines,
Flowshop scheduling with identical jobs and uniform parallel machines
