| Publication | Date of Publication | Type |
|---|
Discrete Lot Streaming In Two-Machine Flow Shops
INFOR: Information Systems and Operational Research | 2023-04-21 | Paper |
New results for scheduling to minimize tardiness on one machine with rejection and related problems
Journal of Scheduling | 2021-12-13 | Paper |
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
European Journal of Operational Research | 2018-05-24 | Paper |
Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
Just-in-Time Systems | 2017-02-03 | Paper |
Single machine scheduling with two competing agents and equal job processing times
European Journal of Operational Research | 2016-10-06 | Paper |
An approximation algorithm for clustering graphs with dominating diametral path
Information Processing Letters | 2016-06-01 | Paper |
Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
Journal of Scheduling | 2015-03-26 | Paper |
A pseudo-polynomial time algorithm for solving the resource dependent assignment problem
Discrete Applied Mathematics | 2015-02-06 | Paper |
Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine
Mathematical Problems in Engineering | 2014-11-24 | Paper |
Single machine batch scheduling with release times and delivery costs
Journal of Scheduling | 2014-08-18 | Paper |
Single-machine scheduling with periodic maintenance to minimize makespan revisited
Journal of Scheduling | 2014-08-18 | Paper |
Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
European Journal of Operational Research | 2014-07-27 | Paper |
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
Journal of Scheduling | 2014-02-05 | Paper |
Revised delivery-time quotation in scheduling with tardiness penalties
Operations Research | 2012-06-26 | Paper |
Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
Annals of Operations Research | 2012-03-09 | Paper |
On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices
Journal of Heuristics | 2011-02-14 | Paper |
`Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
Discrete Applied Mathematics | 2010-11-05 | Paper |
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
Discrete Applied Mathematics | 2010-10-11 | Paper |
Just-in-time scheduling with controllable processing times on parallel machines
Journal of Combinatorial Optimization | 2010-06-11 | Paper |
A unified approach for scheduling with convex resource consumption functions using positional penalties
European Journal of Operational Research | 2010-06-11 | Paper |
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
Journal of Scheduling | 2010-03-08 | Paper |
Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs
Operations Research | 2010-03-06 | Paper |
Single machine batch scheduling to minimize total completion time and resource consumption costs
Journal of Scheduling | 2009-08-28 | Paper |
Optimal due date assignment in multi-machine scheduling environments
Journal of Scheduling | 2009-08-28 | Paper |
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles
Discrete Optimization | 2009-08-19 | Paper |
The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
Annals of Operations Research | 2008-09-03 | Paper |
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters | 2008-01-11 | Paper |
BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS(<Special Issue>Advanced Planning and Scheduling for Supply Chain Management)
Journal of the Operations Research Society of Japan | 2007-10-30 | Paper |
Pareto optima for total weighted completion time and maximum lateness on a single machine
Discrete Applied Mathematics | 2007-10-29 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
| Partitioning a bipartite graph into vertex-disjoint paths. | 2007-09-21 | Paper |
A survey of scheduling with controllable processing times
Discrete Applied Mathematics | 2007-09-18 | Paper |
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics | 2007-05-30 | Paper |
Scheduling in reentrant robotic cells: algorithms and complexity
Journal of Scheduling | 2007-05-15 | Paper |
On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
Journal of Scheduling | 2007-05-15 | Paper |
Two due date assignment problems in scheduling a single machine
Operations Research Letters | 2007-02-19 | Paper |
Partitioning a graph into vertex-disjoint paths
Studia Scientiarum Mathematicarum Hungarica | 2007-01-02 | Paper |
Batch scheduling in a two-level supply chain -- a focus on the supplier
European Journal of Operational Research | 2006-05-29 | Paper |
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Theoretical Computer Science | 2006-04-28 | Paper |
Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
Journal of Combinatorial Optimization | 2005-12-14 | Paper |
The maximum traveling salesman problem on van der Veen matrices
Discrete Applied Mathematics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2050744 (Why is no real title available?) | 2004-03-07 | Paper |
On the \(k\)-path partition of graphs.
Theoretical Computer Science | 2003-08-17 | Paper |
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
Journal of Scheduling | 2003-07-27 | Paper |
| scientific article; zbMATH DE number 1947426 (Why is no real title available?) | 2003-07-08 | Paper |
Efficient algorithms on distributive lattices
Discrete Applied Mathematics | 2002-01-30 | Paper |
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times
European Journal of Operational Research | 2001-07-12 | Paper |
On the k-path partition problem in cographs
Congressus Numerantium | 2001-05-16 | Paper |
Subset-restricted interchange for dynamic min-max scheduling problems
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging
European Journal of Operational Research | 2001-03-04 | Paper |
| scientific article; zbMATH DE number 1409240 (Why is no real title available?) | 2000-03-01 | Paper |
Lot streaming with detached setups in three-machine flow shops
European Journal of Operational Research | 1999-08-05 | Paper |
Approximation methods for discrete lot streaming in flow shops
Operations Research Letters | 1998-01-12 | Paper |
Gray Codes for the Ideals of Interval Orders
Journal of Algorithms | 1998-01-07 | Paper |
Optimal level schedules for mixed-model, multi-level just-in-time assembly systems
Annals of Operations Research | 1997-08-24 | Paper |
1-tough cocomparability graphs are hamiltonian
Discrete Mathematics | 1997-08-10 | Paper |
| scientific article; zbMATH DE number 975389 (Why is no real title available?) | 1997-05-11 | Paper |
Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
Discrete Applied Mathematics | 1997-02-25 | Paper |
A linear time algorithm for maximum matchings in convex, bipartite graphs
Computers & Mathematics with Applications | 1996-11-25 | Paper |
| The recognition of indifference digraphs and generalized semiorders | 1996-02-25 | Paper |
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
SIAM Journal on Computing | 1994-08-14 | Paper |
Level Schedules for Mixed-Model, Just-in-Time Processes
Management Science | 1994-01-02 | Paper |
A note on ``Scheduling unit-time tasks with integer release times and deadlines''
Information Processing Letters | 1993-11-15 | Paper |
Finding the largest suborder of fixed width
Order | 1993-10-17 | Paper |
On estimating the number of order ideals in partial orders, with some applications
Journal of Statistical Planning and Inference | 1993-05-16 | Paper |
| Primal dual algorithms for the vehicle refueling problem | 1993-01-17 | Paper |
Hamiltonian cycle is polynomial on cocomparability graphs
Discrete Applied Mathematics | 1993-01-17 | Paper |
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
Order | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 16221 (Why is no real title available?) | 1992-06-26 | Paper |
Sequencing jobs on a single machine with a common due data and stochastic processing times
European Journal of Operational Research | 1992-06-26 | Paper |
On the complexity of dynamic programming for sequencing problems with precedence constraints
Annals of Operations Research | 1990-01-01 | Paper |
Permutation Schedules for Flow Shops with Precedence Constraints
Operations Research | 1990-01-01 | Paper |
Minimizing bumps in ordered sets by substitution decomposition
Discrete Mathematics | 1989-01-01 | Paper |
Computing the bump number is easy
Order | 1988-01-01 | Paper |
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
Order | 1987-01-01 | Paper |
Searching in 2-dimensional partial orders
Journal of Algorithms | 1987-01-01 | Paper |
An algorithm to generate the ideals of a partial order
Operations Research Letters | 1986-01-01 | Paper |
Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
Operations Research | 1986-01-01 | Paper |
On finding the jump number of a partial order by substitution decomposition
Order | 1985-01-01 | Paper |
An algorithm for minimizing setups in precedence constrained scheduling
Journal of Computational and Applied Mathematics | 1985-01-01 | Paper |
A compact labelling scheme for series-parallel graphs
Discrete Applied Mathematics | 1985-01-01 | Paper |
Single Machine Scheduling with Precedence Constraints of Dimension 2
Mathematics of Operations Research | 1984-01-01 | Paper |
Single Machine Scheduling with Series-Parallel Precedence Constraints
Operations Research | 1981-01-01 | Paper |
