| Publication | Date of Publication | Type |
|---|
Minimizing the maximum late work for a single-machine scheduling problem with flexible maintenance activities
Journal of Scheduling | 2026-06-30 | Paper |
Benders decompositions for order acceptance and scheduling in additive manufacturing
European Journal of Operational Research | 2026-04-27 | Paper |
Scheduling with assignable due dates, two competing agents and late work related criteria
Computers & Operations Research | 2025-09-10 | Paper |
Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work
International Journal of Applied Mathematics and Computer Science | 2025-06-30 | Paper |
Scheduling with a discounted profit criterion on identical machines
Discrete Applied Mathematics | 2025-03-18 | Paper |
Single machine scheduling with the total weighted late work and rejection cost
Naval Research Logistics | 2025-02-11 | Paper |
Exact approaches to late work scheduling on unrelated machines
International Journal of Applied Mathematics and Computer Science | 2023-09-07 | Paper |
Two-machine flow-shop scheduling to minimize total late work: revisited
Engineering Optimization | 2022-12-23 | Paper |
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
Engineering Optimization | 2022-12-23 | Paper |
Two-machine flow shop scheduling with a common due date to maximize total early work
European Journal of Operational Research | 2022-03-18 | Paper |
Mirror scheduling problems with early work and late work criteria
Journal of Scheduling | 2022-01-14 | Paper |
Semi-online scheduling on two identical machines with a common due date to maximize total early work
Discrete Applied Mathematics | 2021-01-13 | Paper |
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
European Journal of Operational Research | 2020-02-25 | Paper |
Scheduling on parallel identical machines with late work criterion: offline and online cases
Journal of Scheduling | 2018-02-28 | Paper |
Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
Journal of Optimization Theory and Applications | 2017-10-27 | Paper |
Complexity of scheduling problem in single-machine flexible manufacturing system with cyclic transportation and unlimited buffers
Journal of Optimization Theory and Applications | 2017-10-27 | Paper |
Revenue maximization on parallel machines
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
Dominance relations for two-machine flow shop problem with late work criterion
Bulletin of the Polish Academy of Sciences. Technical Sciences | 2011-01-19 | Paper |
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
Computers & Operations Research | 2007-10-10 | Paper |
A note on the two machine job shop with the weighted late work criterion
Journal of Scheduling | 2007-05-15 | Paper |
KI 2005: Advances in Artificial Intelligence
Lecture Notes in Computer Science | 2006-11-13 | Paper |
The two-machine flow-shop problem with weighted late work criterion and common due date
European Journal of Operational Research | 2005-04-21 | Paper |
Open shop scheduling problems with late work criteria.
Discrete Applied Mathematics | 2004-01-26 | Paper |
| scientific article; zbMATH DE number 1859342 (Why is no real title available?) | 2003-04-23 | Paper |
The disjunctive graph machine representation of the job shop scheduling problem
European Journal of Operational Research | 2002-08-19 | Paper |
| scientific article; zbMATH DE number 1594554 (Why is no real title available?) | 2001-05-06 | Paper |
A note on disjunctive graph representation
Bulletin of the Polish Academy of Sciences. Technical Sciences | 2000-04-10 | Paper |
