| Publication | Date of Publication | Type |
|---|
Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs
EURO Journal on Computational Optimization | 2024-04-24 | Paper |
The multiple container loading problem with loading docks
International Transactions in Operational Research | 2024-01-31 | Paper |
Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem
Networks | 2023-12-18 | Paper |
New integer programming models for slab stack shuffling problems
Applied Mathematical Modelling | 2022-12-21 | Paper |
The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
European Journal of Operational Research | 2022-02-23 | Paper |
A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering
Journal of Scheduling | 2020-04-22 | Paper |
The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling
European Journal of Operational Research | 2019-06-26 | Paper |
Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
Computers & Operations Research | 2018-07-11 | Paper |
A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
Computational and Applied Mathematics | 2018-02-23 | Paper |
Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs
International Journal of Operational Research | 2017-05-31 | Paper |
An optimal method for the preemptive job shop scheduling problem
Computers & Operations Research | 2017-01-05 | Paper |
A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
Computers & Operations Research | 2016-11-11 | Paper |
Optimizing blocking flow shop scheduling problem with total completion time criterion
Computers & Operations Research | 2016-11-10 | Paper |
A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
Computers & Operations Research | 2016-11-10 | Paper |
Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
Mathematical and Computer Modelling | 2014-05-14 | Paper |
Scheduling linear deteriorating jobs to minimize the number of tardy jobs
Journal of Global Optimization | 2012-12-07 | Paper |
Mathematical models for preemptive shop scheduling problems
Computers & Operations Research | 2012-11-15 | Paper |
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
Computers & Mathematics with Applications | 2012-04-22 | Paper |
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
Computers & Mathematics with Applications | 2011-03-19 | Paper |
A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
International Journal of Operational Research | 2010-11-12 | Paper |
A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
Applied Mathematics and Computation | 2006-04-28 | Paper |
Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
Applied Mathematics and Computation | 2005-10-28 | Paper |
