Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Optim Lett

Search In Journal Title:

Abbravation: Optimization Letters

Search In Journal Abbravation:

Publisher

Springer Berlin Heidelberg

Search In Publisher:

DOI

10.1007/bf02576196

Search In DOI:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

Single machine serialbatching scheduling with ind

Authors: Jun Pei Xinbao Liu Panos M Pardalos Wenjuan Fan Shanlin Yang
Publish Date: 2014/04/03
Volume: 9, Issue: 1, Pages: 91-104
PDF Link

Abstract

This paper investigates the scheduling problems of a single serialbatching machine with independent setup time and deteriorating job processing times With the assumption of deteriorating jobs the job processing times are described by an increasing function of their starting times All the jobs are first partitioned into serial batches and then processed on a single serialbatching machine Before each batch is processed an independent constant setup time is required Two optimization algorithms are proposed to solve the problems of minimizing the makespan and the total number of tardy jobs respectively Specifically for the problem of minimizing the total completion time two special cases with the smallest and the largest number of batches are studied and an optimization algorithm is also presented for the special case without setup timeWe would like to thank the editors and referees for their valuable comments and suggestions This work is supported by the National Natural Science Foundation of China Nos 71231004 71171071 71131002 and LATNA laboratory NRU HSE RF government grant ag 11G34310057

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
  2. The modified proximal point algorithm in CAT(0) spaces
  3. An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
  4. Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach
  5. A semidefinite optimization approach to the Target Visitation Problem
  6. Elementary convex techniques for equilibrium, minimax and variational problems
  7. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
  8. Symmetric duality for second-order fractional programs
  9. Generalized solutions of quasi variational inequalities
  10. A composite model in the context of a production-inventory system
  11. Preserving maximal monotonicity with applications in sum and composition rules
  12. Strong convergence of Mann’s type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces
  13. Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
  14. Polynomial-time identification of robust network flows under uncertain arc failures
  15. A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
  16. Maximizing strike aircraft planning efficiency for a given class of ground targets
  17. Dynamic lot-sizing problem with demand time windows and container-based transportation cost
  18. Sufficient conditions for protection routing in IP networks
  19. A note on diameters of point sets
  20. Capacity optimization through sensing threshold adaptation for cognitive radio networks
  21. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
  22. The perspective of a bank in granting credits: an optimization model
  23. k -Sum decomposition of strongly unimodular matrices
  24. Solving the weighted MAX-SAT problem using the dynamic convexized method
  25. Locating facilities in a competitive environment
  26. A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem
  27. Global optimal approximate solutions
Search Result: