Minimizing Maximum Lateness in a Two-Machine Open Shop

Cited in

(32)

Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
On the complexity of preemptive open-shop scheduling problems
Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
The two-machine flowshop scheduling problem with total tardiness
On the complexity of generalized due date scheduling problems
Job lateness in a two-machine flowshop with setup times separated
Two scheduling problems with fuzzy due-dates
The generalized shifting bottleneck procedure
Two machine open shop scheduling problems with bi-criteria
On the complexity of preemptive openshop scheduling problems
One machine scheduling problem with fuzzy duedates
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
Open shop scheduling problems with late work criteria.
An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
A linear time approximation scheme for makespan minimization in an open shop with release dates
Scheduling two-machine preemptive open shops to minimize total completion time
Complexity of mixed shop scheduling problems: A survey
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates
Four decades of research on the open-shop scheduling problem to minimize the makespan
Minimizing the weighted number of tardy jobs on multiple machines: a review
A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
Multicriteria scheduling
An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system
Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm
Scheduling ordered open shops
On the complexity of proportionate open shop and job shop problems
Scheduling preemptive open shops to minimize total tardiness
Minimizing the sojourn time of open shop scheduling problems with unit-time operations
A note on the flow time and the number of tardy jobs in stochastic open shops
Dense open-shop schedules with release times

This page was built for publication: Minimizing Maximum Lateness in a Two-Machine Open Shop

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