Minimizing maximum lateness in a two-machine unit-time job shop
From MaRDI portal
Publication:1151033
DOI10.1007/BF02277185zbMath0456.68042OpenAlexW1524388527MaRDI QIDQ1151033
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02277185
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
A new lower bound for the job-shop scheduling problem ⋮ A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem ⋮ Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem ⋮ Reliability aware scheduling of bag of real time tasks in cloud environment ⋮ Reduction of job-shop problems to flow-shop problems with precedence constraints ⋮ Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
Cites Work
This page was built for publication: Minimizing maximum lateness in a two-machine unit-time job shop
