Publication | Date of Publication | Type |
---|
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work | 2023-10-24 | Paper |
Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty | 2023-10-10 | Paper |
Two-machine flow shop scheduling with convex resource consumption functions | 2023-06-05 | Paper |
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods | 2022-05-27 | Paper |
A single machine scheduling with generalized and periodic due dates to minimize total deviation | 2022-04-20 | Paper |
Scheduling with generalized and periodic due dates under single- and two-machine environments | 2022-03-15 | Paper |
A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work | 2022-02-01 | Paper |
A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph | 2022-02-01 | Paper |
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty | 2021-08-11 | Paper |
A just-in-time scheduling problem with two competing agents | 2021-02-17 | Paper |
Scheduling two projects with controllable processing times in a single-machine environment | 2020-12-11 | Paper |
Two-machine flow shops with an optimal permutation schedule under a storage constraint | 2020-08-31 | Paper |
Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates | 2020-02-20 | Paper |
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates | 2020-02-10 | Paper |
A linear time-cost tradeoff problem with multiple milestones under a comb graph | 2019-06-25 | Paper |
Minimizing the total weighted delivery time in container transportation scheduling | 2019-03-05 | Paper |
Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals | 2018-12-10 | Paper |
A single-machine scheduling problem with uncertainty in processing times and outsourcing costs | 2018-11-05 | Paper |
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks | 2018-05-29 | Paper |
Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures | 2017-09-22 | Paper |
An Ordered Flow Shop with Two Agents | 2016-12-16 | Paper |
An adaptive crashing policy for stochastic time-cost tradeoff problems | 2016-11-17 | Paper |
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty | 2016-10-07 | Paper |
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs | 2016-10-06 | Paper |
Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs | 2016-06-23 | Paper |
A Batch Scheduling Problem with Two Agents | 2016-02-19 | Paper |
Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs | 2015-12-11 | Paper |
OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES | 2014-11-26 | Paper |
Outsourcing and scheduling for two-machine ordered flow shop scheduling problems | 2014-07-27 | Paper |
Two-agent single-machine scheduling problem with just-in-time jobs | 2014-07-07 | Paper |
JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY | 2013-07-03 | Paper |
Job release scheduling problem: complexity and an approximation algorithm | 2013-04-18 | Paper |
Two-stage proportionate flexible flow shop to minimize the makespan | 2013-04-08 | Paper |
A note on makespan minimization in proportionate flow shops | 2013-04-04 | Paper |
Two-machine flow shop scheduling problem with an outsourcing option | 2012-05-14 | Paper |
Minimizing makespan in an ordered flow shop with machine-dependent processing times | 2012-04-04 | Paper |
A vector space approach to tag cloud similarity ranking | 2012-03-12 | Paper |
Two-stage production scheduling with an outsourcing option | 2011-08-10 | Paper |
Flow shops with machine maintenance: ordered and proportionate cases | 2010-09-09 | Paper |
Complexity of single machine scheduling subject to nonnegative inventory constraints | 2010-09-09 | Paper |
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time | 2010-08-20 | Paper |
Complexity of a scheduling problem with controllable processing times | 2010-05-07 | Paper |
Maximizing the weighted number of just-in-time jobs in flow shop scheduling | 2009-08-28 | Paper |
Two-Server Network Disconnection Problem | 2009-02-10 | Paper |
Polynomiality of sparsest cuts with fixed number of sources | 2008-01-21 | Paper |
Approximability of the k‐server disconnection problem | 2008-01-07 | Paper |
Single machine scheduling problem with controllable processing times and resource dependent release times | 2007-04-19 | Paper |
Single machine scheduling problems with resource dependent release times | 2007-02-19 | Paper |
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed | 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 |