| Publication | Date of Publication | Type |
|---|
A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
Asia-Pacific Journal of Operational Research | 2024-11-12 | Paper |
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
4OR | 2023-10-24 | Paper |
Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
Engineering Optimization | 2023-10-10 | Paper |
Two-machine flow shop scheduling with convex resource consumption functions
Optimization Letters | 2023-06-05 | Paper |
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods
Journal of Scheduling | 2022-05-27 | Paper |
A single machine scheduling with generalized and periodic due dates to minimize total deviation
Discrete Applied Mathematics | 2022-04-20 | Paper |
Scheduling with generalized and periodic due dates under single- and two-machine environments
Optimization Letters | 2022-03-15 | Paper |
A parallel machine scheduling problem maximizing total weighted early work
Asia-Pacific Journal of Operational Research | 2022-02-01 | Paper |
A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
Asia-Pacific Journal of Operational Research | 2022-02-01 | Paper |
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
Journal of Combinatorial Optimization | 2021-08-11 | Paper |
A just-in-time scheduling problem with two competing agents
Optimization Letters | 2021-02-17 | Paper |
Scheduling two projects with controllable processing times in a single-machine environment
Journal of Scheduling | 2020-12-11 | Paper |
Two-machine flow shops with an optimal permutation schedule under a storage constraint
Journal of Scheduling | 2020-08-31 | Paper |
Two-machine ordered flow shop scheduling with generalized due dates
Asia-Pacific Journal of Operational Research | 2020-02-20 | Paper |
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
Operations Research Letters | 2020-02-10 | Paper |
A linear time-cost tradeoff problem with multiple milestones under a comb graph
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Minimizing the total weighted delivery time in container transportation scheduling
Naval Research Logistics | 2019-03-05 | Paper |
Just-in-time scheduling with generalized due dates and identical due date intervals
Asia-Pacific Journal of Operational Research | 2018-12-10 | Paper |
A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
Mathematical Problems in Engineering | 2018-11-05 | Paper |
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
European Journal of Operational Research | 2018-05-29 | Paper |
Two-machine and two-agent flow shop with special processing times structures
Asia-Pacific Journal of Operational Research | 2017-09-22 | Paper |
An ordered flow shop with two agents
Asia-Pacific Journal of Operational Research | 2016-12-16 | Paper |
An adaptive crashing policy for stochastic time-cost tradeoff problems
Computers & Operations Research | 2016-11-17 | Paper |
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
European Journal of Operational Research | 2016-10-07 | Paper |
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
European Journal of Operational Research | 2016-10-06 | Paper |
Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
European Journal of Operational Research | 2016-06-23 | Paper |
A batch scheduling problem with two agents
Asia-Pacific Journal of Operational Research | 2016-02-19 | Paper |
Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs
Asia-Pacific Journal of Operational Research | 2015-12-11 | Paper |
Outsourcing decisions in \(m\)-machine permutation flow shop scheduling problems with machine-dependent processing times
Asia-Pacific Journal of Operational Research | 2014-11-26 | Paper |
Outsourcing and scheduling for two-machine ordered flow shop scheduling problems
European Journal of Operational Research | 2014-07-27 | Paper |
Two-agent single-machine scheduling problem with just-in-time jobs
Theoretical Computer Science | 2014-07-07 | Paper |
Just-in-time scheduling under scenario-based uncertainty
Asia-Pacific Journal of Operational Research | 2013-07-03 | Paper |
Job release scheduling problem: complexity and an approximation algorithm
Discrete Applied Mathematics | 2013-04-18 | Paper |
Two-stage proportionate flexible flow shop to minimize the makespan
Journal of Combinatorial Optimization | 2013-04-08 | Paper |
A note on makespan minimization in proportionate flow shops
Information Processing Letters | 2013-04-04 | Paper |
Two-machine flow shop scheduling problem with an outsourcing option
European Journal of Operational Research | 2012-05-14 | Paper |
Minimizing makespan in an ordered flow shop with machine-dependent processing times
Journal of Combinatorial Optimization | 2012-04-04 | Paper |
A vector space approach to tag cloud similarity ranking
Information Processing Letters | 2012-03-12 | Paper |
Two-stage production scheduling with an outsourcing option
European Journal of Operational Research | 2011-08-10 | Paper |
Complexity of single machine scheduling subject to nonnegative inventory constraints
European Journal of Operational Research | 2010-09-09 | Paper |
Flow shops with machine maintenance: ordered and proportionate cases
European Journal of Operational Research | 2010-09-09 | Paper |
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Information Processing Letters | 2010-08-20 | Paper |
Complexity of a scheduling problem with controllable processing times
Operations Research Letters | 2010-05-07 | Paper |
Maximizing the weighted number of just-in-time jobs in flow shop scheduling
Journal of Scheduling | 2009-08-28 | Paper |
Two-Server Network Disconnection Problem
Computational Science and Its Applications - ICCSA 2006 | 2009-02-10 | Paper |
Polynomiality of sparsest cuts with fixed number of sources
Operations Research Letters | 2008-01-21 | Paper |
Approximability of the k‐server disconnection problem
Networks | 2008-01-07 | Paper |
Single machine scheduling problem with controllable processing times and resource dependent release times
European Journal of Operational Research | 2007-04-19 | Paper |
Single machine scheduling problems with resource dependent release times
Computers & Operations Research | 2007-02-19 | Paper |
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
European Journal of Operational Research | 2006-11-15 | Paper |
| Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds | 2006-07-13 | Paper |
